Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts

DOI10.1145/3128600zbMath1422.68137arXiv1304.7505OpenAlexW1955711040MaRDI QIDQ4554936

Saket Saurabh, M. S. Ramanujan

Publication date: 12 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

graph bipartizationgraph separation problemsbackdoors to satisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

SAT backdoors: depth beats size ⋮ Faster graph bipartization

This page was built for publication: Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts