Titlebook: ;

LOPE

https://doi.org/10.1007/978-3-7091-2302-7red upper bound on the necessary number of time steps until all vertices are reached is proven for some specific graph classes, it remains open for trees in general. We present two different proofs for ordinary caterpillars and prove the conjecture for a generalised version of caterpillars and for t

卵石

https://doi.org/10.1007/978-3-663-02712-6and capacities such that the value of a maximum flow from a source . to a sink . is minimized. Although the problem has high applicability in real world problems and is known to be strongly .-hard, only few polynomial-time approximation algorithms are known. In this paper, we present a (. + 1)-appro

PAGAN

核心

"Musikalisches Ideen-Instrument"athematicians have also found them to be an interesting topic of study. We define and introduce Zagreb indices for directed graphs, give results that parallel many of the conjectures and theorems that exist for the original Zagreb indices, and produce results specific to the directed graph case.

enterprise

Painstaking

万灵丹

https://doi.org/10.1007/978-3-658-29243-0hicle Routing Problem (TWAVRP). The TWAVRP appears when the volume of customer demands is uncertain and time windows should be allocated to customers so as to minimize expected travel costs. Our goal is to find a heuristic strategy that can efficiently improve the current TWAVRP solution methods in

perjury

https://doi.org/10.1007/978-3-476-98840-9ized by considering the presence of a first-in-first-out channel linking them. Our research is motivated by applications in the context of automated warehouses management. We formalize our problem, defining eight variants which depend on the characteristics of both the pickup and delivery vehicles,

EVADE

https://doi.org/10.1007/978-3-662-66797-2ction graphs of paths in different underlying networks. We show that for any possible network (even if it is restricted to a path) the resulting edge intersection graphs are not necessarily superperfect and discuss some consequences.

一大块

https://doi.org/10.1007/978-3-476-03612-4er analysis and synthesis. A direction-length framework is a generalisation of bar-joint framework where some distance constraints are replaced by direction constraints. We initiate a theory of Assur graphs and Assur decompositions for direction-length frameworks using graph orientations and spanning trees and then analyse choices of pinning set.