Sciweavers

Share
DAGSTUHL
2007

Exact Elimination of Cycles in Graphs

11 years 2 months ago
Exact Elimination of Cycles in Graphs
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∗
Daniel Raible, Henning Fernau
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where DAGSTUHL
Authors Daniel Raible, Henning Fernau
Comments (0)
books