A functional approach to external graph algorithms

DOI10.1007/S00453-001-0088-5zbMATH Open1009.68184DBLPjournals/algorithmica/AbelloBW02OpenAlexW358088974WikidataQ67224672 ScholiaQ67224672MaRDI QIDQ1348943FDOQ1348943

Authors: Adam L. Buchsbaum, Jeffery R. 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

Recommendations

• scientific article; zbMATH DE number 1305093
• Algorithm Theory - SWAT 2004
• Publication:4886043
• On external-memory MST, SSSP and multi-way planar graph separation
• scientific article; zbMATH DE number 2163020

zbMATH Keywords

external graph algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (16)

• Flow decompositions in external memory
• On graph problems in a semi-streaming model
• Title not available (Why is that?)
• I/O-efficient algorithms for graphs of bounded treewidth
• Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
• An I/O efficient algorithm for minimum spanning trees
• Fast transformation from time series to visibility graphs
• Temporal pattern in Corinth rift seismicity revealed by visibility graph analysis
• Algorithm Theory - SWAT 2004
• A computational model for generic graph functions
• External memory algorithms for finding disjoint paths in undirected graphs
• On Trade-Offs in External-Memory Diameter-Approximation
• Title not available (Why is that?)
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• Via Detours to I/O-Efficient Shortest Paths
• Title not available (Why is that?)

This page was built for publication: A functional approach to external graph algorithms

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