Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems

DOI10.1006/jagm.1995.1027zbMath0836.68043OpenAlexW1980347321MaRDI QIDQ4840219

Greg N. Frederickson

Publication date: 11 April 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f9e21b22da70996ce1d1ba33f28bb62c46920b77

zbMATH Keywords

succinct encoding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (3)

Searching among intervals and compact routing tables ⋮ Algorithmic graph embeddings ⋮ Faster algorithms for shortest path and network flow based on graph decomposition

This page was built for publication: Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems