202 search results - page 2 / 41 » Cycle Cover with Short Cycles |
WAOA
2005
Springer
13 years 11 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
EJC
2002
13 years 5 months ago
2002
A cycle in a matroid is a disjoint union of circuits. This paper proves that every regular matroid M without coloops has a set S of cycles whose union is E(M) such that every elem...
ANTSW
2010
Springer
13 years 3 months ago
2010
Springer
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
Publication
Concern over climate change, traffic congestion, and the health consequences of
sedentary lifestyles has resulted in a surge of interest in cycling as an efficient form of
urban ...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...