A functional approach to external graph algorithms
From MaRDI portal
Publication:1348943
DOI10.1007/s00453-001-0088-5zbMath1009.68184DBLPjournals/algorithmica/AbelloBW02OpenAlexW358088974WikidataQ67224672 ScholiaQ67224672MaRDI QIDQ1348943
Adam L. Buchsbaum, Jeffery Westbrook, James Abello
Publication date: 21 May 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0088-5
Related Items (9)
Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components ⋮ I/O-efficient algorithms for graphs of bounded treewidth ⋮ An I/O Efficient Algorithm for Minimum Spanning Trees ⋮ Fast transformation from time series to visibility graphs ⋮ On Trade-Offs in External-Memory Diameter-Approximation ⋮ Temporal pattern in Corinth rift seismicity revealed by visibility graph analysis ⋮ Design and Engineering of External Memory Traversal Algorithms for General Graphs ⋮ Via Detours to I/O-Efficient Shortest Paths ⋮ On graph problems in a semi-streaming model
This page was built for publication: A functional approach to external graph algorithms
