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

DOI10.4230/LIPICS.IPEC.2019.9MaRDI QIDQ5875541zbMATH OpenOpenAlexFDO

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

Publication date 3 February 2023

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

zbMATH Keywords

carving-widthclustered planarityFPTnon-crossing partitions

Mathematics Subject Classification ID

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

Recommendations

• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Subexponential-time and FPT algorithms for embedded flat clustered planarity
• Efficient C-planarity testing for embedded flat clustered graphs with small faces
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• scientific article; zbMATH DE number 1974122

Cited in

(6)

• Subexponential-time and FPT algorithms for embedded flat clustered planarity
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Beyond Clustered Planar Graphs
• Parameterized complexity of graph planarity with restricted cyclic orders
• Grid recognition: classical and parameterized computational perspectives
• The role of twins in computing planar supports of hypergraphs

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

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