Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs

Authors:
Henning Fernau;Daniel Raible
Affiliations:
Univ. Trier, Abteilung Informatik, Trier, Germany;Univ. Trier, Abteilung Informatik, Trier, Germany
Venue:
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Year:
2008

Citing 11
Cited 2

Approximation alogorithms for the maximum acyclic subgraph problem

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
Flowchart techniques for structured programming

ACM SIGPLAN Notices
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG

Information Processing Letters
Measure and conquer: domination – a case study

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Parameterized algorithms for HITTING SET: the weighted case

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Parameterizing MAX SNP problems above guaranteed values

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Finding a minimum feedback vertex set in time O(1.7548n)

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Improved algorithms for the feedback vertex set problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An improved parameterized algorithm for the minimum node multiway cut problem

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Parameterized Complexity

Parameterized Complexity

Searching Trees: An Essay

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
An Amortized Search Tree Analysis for k-Leaf Spanning Tree

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (one is exact, the other parameterized) for (1, n)-graphs, a class containing cubic graphs. The running times are O*(1.1871m) and O*(1.212k), respectively, determined by an amortized analysis via a non-standard measure.