601 search results - page 4 / 121 » Edge-dominating cycles in graphs |
TPDS
2010
14 years 8 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
JAIR
1998
14 years 10 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
121
Voted
COMGEO
2012
ACM
13 years 6 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
67
Voted
ENDM
2002
14 years 10 months ago
2002
Two types of robust cycle bases are defined via recursively nice arrangements; complete and bipartite complete graphs are shown to have such bases. It is shown that a diagram in a...
80
Voted
SIAMDM
2008
14 years 9 months ago
2008
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...