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

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 partitionsFPTclustered planaritycarving-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

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