Finding Disjoint Paths in Split Graphs
From MaRDI portal
Publication:2938109
DOI10.1007/978-3-319-04298-5_28zbMath1432.68357OpenAlexW1539965287MaRDI QIDQ2938109
Erik Jan van Leeuwen, Reza Saei, Pinar Heggernes, Pim van 't Hof
Publication date: 13 January 2015
Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04298-5_28
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
Induced disjoint paths in circular-arc graphs in linear time ⋮ Finding disjoint paths in split graphs
This page was built for publication: Finding Disjoint Paths in Split Graphs
