Discovery of network properties with all-shortest-paths queries
type: Item
instance of: scholarly article
title: Discovery of network properties with all-shortest-paths queries
zbMATH Open document ID: 1191.68028
author: D. Bilò
author: Matúš Mihalák
author: Peter Widmayer
author: Thomas Erlebach
published in: Theoretical Computer Science
publication date: 2010-04-06T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5689486
zbMATH Keywords: graph property
zbMATH Keywords: network
zbMATH Keywords: discovery
zbMATH Keywords: query
zbMATH Keywords: online algorithm
zbMATH Keywords: shortest path
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.01.010
OpenAlex ID: W2050803155
cites work: Q5315023
cites work: Emergence of Scaling in Random Networks
cites work: On recognizing graph properties from adjacency matrices
cites work: Q4788610
cites work: Q4464781
cites work: Q4796165
cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
DOI: 10.1016/J.TCS.2010.01.010
description: scientific article; zbMATH DE number 5689486