Subexponential-time and FPT algorithms for embedded flat clustered planarity

DOI10.1007/978-3-030-00256-5_10OpenAlexW2963573880MaRDI QIDQ1627160

Michael T. Goodrich, Giordano Da Lozzo, David Eppstein, Siddharth Gupta

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1803.05465

Mathematics Subject Classification ID

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

Related Items (8)

Planar drawings with few slopes of Halin graphs and nested pseudotrees ⋮ Fixed-parameter tractability for book drawing with bounded number of crossings per edge ⋮ Clustered planarity with pipes ⋮ Grid recognition: classical and parameterized computational perspectives ⋮ Parameterized approaches to orthogonal compaction ⋮ Clustered planarity = flat clustered planarity ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Beyond Clustered Planar Graphs

This page was built for publication: Subexponential-time and FPT algorithms for embedded flat clustered planarity