686 search results - page 19 / 138 » Packing Cycles in Graphs |
123
Voted
COMBINATORICA
2010
14 years 10 months ago
2010
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we charact...
136
Voted
JGAA
2006
15 years 3 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
121
Voted
COCO
2010
Springer
15 years 28 days ago
2010
Springer
An even cycle in a graph is called nice by Lov
147
Voted
TPDS
2010
15 years 1 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...
119
click to vote
DM
2008
15 years 3 months ago
2008
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...