601 search results - page 19 / 121 » Edge-dominating cycles in graphs |
JGT
2006
13 years 10 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
STACS
2005
Springer
14 years 3 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
PDP
2007
IEEE
14 years 4 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
COMBINATORICA
2007
13 years 10 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
TCS
2008
13 years 10 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...