Dynamic approximate all-pairs shortest paths in undirected graphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1247.68340
DOI: 10.1137/090776573
author: Liam Roditty
author: Uri Zwick
published in: SIAM Journal on Computing
publication date: 2012-09-12T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6081209
zbMATH Keywords: approximate all-pairs shortest paths problem
zbMATH Keywords: unweighted undirected graphs
zbMATH Keywords: dynamic algorithms
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1137/090776573
OpenAlex ID: W2015725509
title: Dynamic approximate all-pairs shortest paths in undirected graphs
description: scientific article; zbMATH DE number 6081209