686 search results - page 77 / 138 » Packing Cycles in Graphs |
85
Voted
SIROCCO
2010
15 years 2 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
100
Voted
CATA
2007
15 years 2 months ago
2007
This paper addresses the issue of determining the iteration bound for a synchronous data flow graph (SDFG) and determining whether or not a SDFG is live based on some calculations...
86
Voted
CORR
2010
Springer
15 years 21 days ago
2010
Springer
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
75
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonHamiltonian edges from the associated gra...
78
Voted
CG
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...