I/O-Optimal Algorithms for Outerplanar Graphs

From MaRDI portal

Revision as of 18:17, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4679081

Jump to:navigation, search

DOI10.7155/jgaa.00082zbMath1090.68123OpenAlexW2138841062MaRDI QIDQ4679081

Norbert Zeh, Anil Maheshwari

Publication date: 25 May 2005

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

Full work available at URL: https://eudml.org/doc/52455

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

I/O-efficient algorithms for graphs of bounded treewidth ⋮ Area-efficient planar straight-line drawings of outerplanar graphs ⋮ Shortest beer path queries in outerplanar graphs

This page was built for publication: I/O-Optimal Algorithms for Outerplanar Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4679081&oldid=18896859"