Exact Elimination of Cycles in Graphs

Abstract. One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms for this problem. In particular we examine a graph class called (1, n)-graphs, which contains cubic graphs. We discuss exact and parameterized algorithms, where we use a non-standard measure approach for the analysis. Especially the analysis of the parameterized algorithm is of special interest, as it is not an amortized analysis modelled by ’finite states ’ but is rather a ’top-down ’ amortized analysis. For (1, n)-graphs we achieve a running time of O ∗ (1.1871 m) and O ∗ (1.212 k), for cubic graphs O ∗ (1.1798 m) and O ∗ (1.201 k), respectively. As a by-product the the trivial bound of 2 n for Feedback Vertex Set on planar directed graphs is broken.