A contraction algorithm for finding minimal feedback sets

Authors:
Henning Koehler
Affiliations:
Massey University, Palmerston North, New Zealand
Venue:
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Year:
2005

Citing 5
Cited 1

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Finding a minimum feedback arc set in reducible flow graphs

Journal of Algorithms
A contraction algorithm for finding small cycle cutsets

Journal of Algorithms
Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)
Characterizations of Reducible Flow Graphs

Journal of the ACM (JACM)

Small witnesses for abstract interpretation-based proofs

ESOP'07 Proceedings of the 16th European conference on Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a contraction algorithm for finding a minimal set of arcs or vertices that break all cycles in a digraph. The algorithm is (essentially) an extension to the contraction algorithm for the feedback vertex set problem introduced by Levy and Lew (Levy & Lew 1988). The algorithm's time complexity of O (m log n) is preserved, while allowing both (weighted) feedback vertices and arcs. As the transformation from feedback arc set to feedback vertex set graph increases the graph's size, the new algorithm becomes both faster and more powerful than the original one when applied to feedback are set problems. We will show that the algorithm works well for reducible flow graphs, as it preserves the structure and can easily be combined with the algorithm proposed by Ramachandran (Ramachandran 1988).