Edge bipartization faster than \(2^k\)

DOI10.1007/s00453-017-0319-zzbMath1418.68171WikidataQ59608568 ScholiaQ59608568MaRDI QIDQ666655

Marcin Pilipczuk, Michał Pilipczuk, Marcin Wrochna

Publication date: 11 March 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-017-0319-z

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)