601 search results - page 79 / 121 » Edge-dominating cycles in graphs |
DAM
2008
13 years 8 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
GC
2006
Springer
13 years 8 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
JCT
2008
13 years 8 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
ROBOCUP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
CIAC
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...