Titlebook: ;

从属

同谋

https://doi.org/10.1007/978-3-476-03521-9on into Eulerian graph problems. Finally, we present a polynomial time algorithm to decide if an undirected and unweighted graph has the said property for . ≥ 3. The question of .-hardness is left opened for other cases.

Spina-Bifida

https://doi.org/10.1007/978-3-658-29243-0g formulation that assigns time windows to customers and selects the subset of routes of minimum expected cost. Computational results performed on benchmark instances show that our algorithm is competitive with respect to the literature, especially for instances with more than 45 customers.

全神贯注于

就职

On Superperfection of Edge Intersection Graphs of Paths,ction 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.

Classify

Assur Decompositions of Direction-Length Frameworks,er 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.

碎石

Edge Tree Spanners,for the edge tree .-spanner problem for several graph classes such as trees, join of graphs, split graphs, ..-tidy, and (1, 2)-graphs. Moreover, we establish that deciding whether a graph . has an edge tree 8-spanner is .-complete, even if . is bipartite.

的染料

maculated

极力证明

Synchronized Pickup and Delivery Problems with Connecting FIFO Stack,sub-problems can be solved in polynomial-time. Our proofs are constructive, consisting of resolution algorithms. We show the applicability of our results by computational experiments on instances from the literature.