Exact Elimination of Cycles in Graphs

Authors Daniel Raible, Henning Fernau



PDF
Thumbnail PDF

File

DagSemProc.07281.6.pdf
  • Filesize: 323 kB
  • 25 pages

Document Identifiers

Author Details

Daniel Raible
Henning Fernau

Cite AsGet BibTex

Daniel Raible and Henning Fernau. Exact Elimination of Cycles in Graphs. In Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Dagstuhl Seminar Proceedings, Volume 7281, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/DagSemProc.07281.6

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. For both exact and parameterized algorithms we use a non-standard measure approach for the analysis. The analysis of the parameterized algorithm is of special interest, as it is not an amortized analysis modelled by 'finite states' but rather a 'top-down' amortized analysis. For $(1,n)$-graphs we achieve a running time of $Oh^*(1.1871^m)$ and $Oh^*(1.212^k)$, for cubic graphs $Oh^*(1.1798^m)$ and $Oh^*(1.201^k)$, respectively. As a by-product the trivial bound of $2^n$ for {sc Feedback Vertex Set} on planar directed graphs is broken.
Keywords
  • Maximum Acyclic Subgraph
  • Feedback Arc Set
  • Amortized Analysis
  • Exact exponential algorthms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads