Computing extremal and approximate distances in graphs having unit cost edges
type: Item
instance of: scholarly article
title: Computing extremal and approximate distances in graphs having unit cost edges
zbMATH Open document ID: 0445.90090
DOI: 10.1007/BF00264532
author: Kellogg S. Booth
author: Richard J. Lipton
published in: Acta Informatica
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 3696860
zbMATH Keywords: binary search
zbMATH Keywords: Strassen-like matrix multiplication algorithm
zbMATH Keywords: unit cost (unweighted) edges
zbMATH Keywords: computation of distances
zbMATH Keywords: undirected graphs
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bf00264532
OpenAlex ID: W2019730496
description: scientific article; zbMATH DE number 3696860