6740 search results - page 392 / 1348 » An s -Hamiltonian Line Graph Problem |
132
click to vote
COCOC
1995
15 years 8 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
152
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
128
click to vote
TCS
2008
15 years 4 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
157
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...
154
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...