scientific article; zbMATH DE number 1522938

zbMATH Open0964.68111MaRDI QIDQ4511234FDOQ4511234

Authors: Anil Maheshwari, Norbert Zeh 

Publication date: 8 July 2001

Title of this publication is not available (Why is that?)

Recommendations

• I/O-Optimal Algorithms for Outerplanar Graphs
• scientific article; zbMATH DE number 1830757
• On External-Memory Planar Depth First Search
• An external memory data structure for shortest path queries
• External memory BFS on undirected graphs with bounded degree.

zbMATH Keywords

external memory algorithmsouterplanarity testing

Mathematics Subject Classification ID

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

Cited In (13)

• An external memory data structure for shortest path queries
• A computational study of external-memory BFS algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Laplacian spectral radius of graphs on surfaces
• An external-memory algorithm for string graph construction
• An improved algorithm for finding maximum outerplanar subgraphs
• Splitting plane graphs to outerplanarity
• Heuristics for the maximum outerplanar subgraph problem
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• Splitting plane graphs to outerplanarity
• I/O-Optimal Algorithms for Outerplanar Graphs
• On External-Memory Planar Depth First Search

This page was built for publication:

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