601 search results - page 52 / 121 » Edge-dominating cycles in graphs |
WEBI
2005
Springer
14 years 2 months ago
2005
Springer
Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the web may be modeled as a digraph, such algorithm...
ESA
1997
Springer
14 years 27 days ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
LMCS
2006
13 years 8 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
JSC
2007
13 years 8 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
IM
2007
13 years 8 months ago
2007
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...