I/O and space-efficient path traversal in planar graphs

DOI10.1007/978-3-642-10631-6_118zbMATH Open1272.05194OpenAlexW1516543827MaRDI QIDQ3652302FDOQ3652302

Authors: Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh 

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://ir.library.carleton.ca/pub/4776

Recommendations

• I/O-efficient path traversal in succinct planar graphs
• An external memory data structure for shortest path queries
• Succinct representations of planar maps
• I/O-efficient algorithms on near-planar graphs
• Planar graph blocking for external searching

zbMATH Keywords

block sizepath lengthrepresentation of bounded-degree planar graphstriangular-irregular network

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (5)

• Planar graph blocking for external searching
• Succinct and I/O efficient data structures for traversal in trees
• Title not available (Why is that?)
• Succinct and I/O Efficient Data Structures for Traversal in Trees
• I/O-efficient path traversal in succinct planar graphs

This page was built for publication: I/O and space-efficient path traversal in planar graphs

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