2 search results - page 1 / 1 » Easy and hard instances of arc ranking in directed graphs |
DAM
2007
13 years 4 months ago
2007
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
AAAI
2010
13 years 6 months ago
2010
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...