A faster FPT algorithm for bipartite contraction

DOI10.1007/978-3-319-03898-8_16MaRDI QIDQ6828594zbMATH OpenFDO

Authors Sylvain Guillemot, Dániel Marx

Publication date 10 December 2013

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

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) Randomized algorithms (68W20)

This page was built for publication: A faster FPT algorithm for bipartite contraction

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