scientific article; zbMATH DE number 1947435
From MaRDI portal
Publication:4411404
zbMath1019.68595MaRDI QIDQ4411404
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610723.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
I/O-efficient algorithms for graphs of bounded treewidth ⋮ An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications ⋮ Unnamed Item ⋮ On Trade-Offs in External-Memory Diameter-Approximation ⋮ Semi-external LTL Model Checking ⋮ Optimal cache-oblivious mesh layouts ⋮ Design and Engineering of External Memory Traversal Algorithms for General Graphs ⋮ Via Detours to I/O-Efficient Shortest Paths ⋮ Unnamed Item
This page was built for publication:
