Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors

DOI10.1007/s00453-004-1125-yzbMath1065.68110MaRDI QIDQ1774147

Erik D. Demaine, Dimitrios M. Thilikos, Mohammad Taghi Hajiaghayi

Publication date: 29 April 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1125-y

zbMATH Keywords

planar graphs; exponential speedup

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

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