C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.

From MaRDI portal

Revision as of 05:58, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5875541

Jump to:navigation, search

DOI10.4230/LIPIcs.IPEC.2019.9OpenAlexW2997607600MaRDI QIDQ5875541

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

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2019.9

zbMATH Keywords

non-crossing partitions FPT clustered planarity carving-width

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (3)

Grid recognition: classical and parameterized computational perspectives ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Beyond Clustered Planar Graphs

This page was built for publication: C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5875541&oldid=30743481"