Space-efficient graph coarsening with applications to succinct planar encodings

DOI10.4230/LIPICS.ISAAC.2022.62MaRDI QIDQ6602489FDO

Authors Frank Kammer, Johannes Meintrup

Publication date 11 September 2024

zbMATH Keywords

planar graphtree decompositionseparatorspace-efficient\(H\)-minor-free

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Space-efficient graph coarsening with applications to succinct planar encodings

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