Compact I/O-efficient representation of separable graphs and optimal tree layouts

DOI10.1007/978-3-030-14812-6_14MaRDI QIDQ2327474zbMATH OpenOpenAlexFDO

Authors Tomáš Gavenčiak, Jakub Tětek

Publication date 15 October 2019

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

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 2079399
• I/O-Efficient Planar Separators
• Succinct representations of separable graphs
• scientific article; zbMATH DE number 2119685
• I/O-efficient algorithms for graphs of bounded treewidth

Cited in

(3)

• I/O-efficient well-separated pair decomposition and applications
• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
• I/O-efficient algorithms for graphs of bounded treewidth

This page was built for publication: Compact I/O-efficient representation of separable graphs and optimal tree layouts

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