Finding disjoint paths in split graphs

DOI10.1007/s00224-014-9580-6zbMath1329.68142MaRDI QIDQ493652

Pinar Heggernes, Erik Jan van Leeuwen, Pim van 't Hof, Reza Saei

Publication date: 4 September 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-014-9580-6

zbMATH Keywords

computational complexity; split graphs; parameterized complexity; polynomial kernel; disjoint paths

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)