All pairs lightest shortest paths
type: Item
instance of: scholarly article
title: All pairs lightest shortest paths
zbMATH Open document ID: 1345.05106
DOI: 10.1145/301250.301271
author: Uri Zwick
published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing
publication date: 2016-09-29T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6631048
Wikidata QID: Q60299176
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1145/301250.301271
OpenAlex ID: W1987719024
DBLP publication ID: conf/stoc/Zwick99
Recommended article: All-Pairs Almost Shortest Paths
Recommended article: The all-pairs quickest path problem
Recommended article: Two fast algorithms for all-pairs shortest paths
Recommended article: Shortest paths between shortest paths
Recommended article: All pairs shortest paths for graphs with small integer length edges
Recommended article: All-pairs small-stretch paths
Recommended article: Q4886059
Recommended article: All pairs shortest paths using bridging sets and rectangular matrix multiplication
Recommended article: On the exponent of all pairs shortest path problem
Recommended article: All-pairs shortest paths and the essential subgraph
description: scientific article; zbMATH DE number 6631048