Linear-time graph distance and diameter approximation

DOI10.1111/itor.12236zbMath1348.90602OpenAlexW2270090871MaRDI QIDQ2827756

Celina M. Herrera de Figueiredo, Raphael C. S. Machado

Publication date: 21 October 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12236

zbMATH Keywords

distance in graphsgraph diameterbreadth first searchlinear-time algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Distance in graphs (05C12)

Related Items (1)

The diameter of AT‐free graphs

Cites Work

• On the power of BFS to determine a graph's diameter

This page was built for publication: Linear-time graph distance and diameter approximation