Linear time parameterized algorithms via skew-symmetric multicuts

DOI10.1137/1.9781611973402.126MaRDI QIDQ5384088zbMATH OpenOpenAlexFDO

Authors M. S. Ramanujan, Saket Saurabh

Publication date 20 June 2019

Published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973402.126

Mathematics Subject Classification ID

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

Recommendations

• Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
• Parameterized approximations via d-skew-symmetric multicut
• Maximum skew-symmetric flows and matchings
• Faster graph bipartization
• Maximum skew-symmetric flows

Cited in

(9)

• Backdoors to q-Horn
• Half-integrality, LP-branching, and FPT algorithms
• Parameterized approximations via d-skew-symmetric multicut
• Odd multiway cut in directed acyclic graphs
• Linear time parameterized algorithms for subset feedback vertex set
• Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
• A Linear-Time Parameterized Algorithm for Node Unique Label Cover
• scientific article; zbMATH DE number 7278081 (Why is no real title available?)
• Hitting selected (odd) cycles

This page was built for publication: Linear time parameterized algorithms via skew-symmetric multicuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384088)