Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
type: Item
instance of: scholarly article
title: Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
zbMATH Open document ID: 0799.68148
DOI: 10.1137/0222071
author: Daphne Koller
author: David R. Karger
author: Steven J. Phillips
published in: SIAM Journal on Computing
publication date: 1994-02-07T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 495788
zbMATH Keywords: all-pairs shortest paths
zbMATH Keywords: weighted graphs
zbMATH Keywords: lower bound
zbMATH Keywords: path comparison
zbMATH Keywords: random graphs
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1137/0222071
OpenAlex ID: W2133768189
description: scientific article; zbMATH DE number 495788