Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs

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

• Type: Conference
• Year: 2008
• Where: WALCOM
• Authors: Henning Fernau, Daniel Raible
• Keywords: Algorithms, Efficient Algorithms, Maximum Acyclic Subgraph, Parameterized Perspective, WALCOM 2008