686 search results - page 114 / 138 » Packing Cycles in Graphs |
WG
2010
Springer
14 years 7 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
SOFSEM
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
69
Voted
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper proposes distributed control laws for maintaining the shape of a formation of mobile autonomous agents in the plane for which the desired shape is defined in terms ...
GD
2009
Springer
15 years 2 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...