983 search results - page 11 / 197 » Negative-Weight Cycle Algorithms |
SODA
1994
ACM
15 years 3 months ago
1994
ACM
126
click to vote
WG
2009
Springer
15 years 9 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
105
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
122
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
115
click to vote
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in t...