I/O-Efficient Algorithms on Near-Planar Graphs

DOI10.7155/jgaa.00236zbMath1276.05114OpenAlexW2130408693MaRDI QIDQ5891342

Laura Toma, Herman J. Haverkort

Publication date: 28 November 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00236

zbMATH Keywords

computational complexityI/O-efficient algorithmsbasic graph problemssparse directed graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications