Feedback Vertex Set in Mixed Graphs

DOI10.1007/978-3-642-22300-6_11zbMath1342.05180arXiv1010.5974OpenAlexW1573376749MaRDI QIDQ5199236

Paul Bonsma, Daniel Lokshtanov

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.5974

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Backdoors to Satisfaction ⋮ Odd cycle transversal in mixed graphs ⋮ A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between ⋮ Efficient algorithms for measuring the funnel-likeness of DAGs ⋮ Dynamic parameterized problems ⋮ Backdoors to tractable answer set programming

This page was built for publication: Feedback Vertex Set in Mixed Graphs