1162 search results - page 4 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
JSAC
2008
13 years 7 months ago
2008
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
WG
2007
Springer
14 years 2 months ago
2007
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 ...
JGAA
2006
13 years 7 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...
STOC
2010
ACM
14 years 5 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...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...