FPT algorithms for plane completion problems

DOI10.4230/LIPICS.MFCS.2016.26MaRDI QIDQ4608585zbMATH OpenFDO

Authors Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros

Publication date 21 March 2018

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2016.26

zbMATH Keywords

completion problemsFPTplane graphstopological isomorphism

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Planar disjoint-paths completion
• Planar disjoint-paths completion
• Variants of plane diameter completion
• On plane subgraphs of complete topological drawings
• scientific article; zbMATH DE number 177556

Cited in

(5)

• Planar disjoint-paths completion
• Planar disjoint-paths completion
• Modification to Planarity is Fixed Parameter Tractable
• Variants of plane diameter completion
• Removing Connected Obstacles in the Plane is FPT

This page was built for publication: FPT algorithms for plane completion problems

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