Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
From MaRDI portal
Publication:5452161
DOI10.1007/978-3-540-77891-2_14zbMATH Open1132.05326OpenAlexW1833689605MaRDI QIDQ5452161FDOQ5452161
Authors: Henning Fernau, Daniel Raible 
Publication date: 25 March 2008
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77891-2_14
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Reducibility among Combinatorial Problems
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Automata, Languages and Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parameterizing MAX SNP Problems Above Guaranteed Values
- Title not available (Why is that?)
- Parameterized Algorithms for Hitting Set: The Weighted Case
- Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
- Improved Algorithms for the Feedback Vertex Set Problems
- Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
- Title not available (Why is that?)
Cited In (7)
- Enumerate and measure: improving parameter budget management
- Tight Bounds for the Maximum Acyclic Subgraph Problem
- Title not available (Why is that?)
- A cubic algorithm for the directed Eulerian subgraph problem
- Title not available (Why is that?)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
- Parameterized measure \& conquer for problems with no small kernels
This page was built for publication: Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452161)
