The generalized diameter of a graph

DOI10.1002/net.3230120310zbMath0508.90034OpenAlexW2061121600MaRDI QIDQ4747886

Robert Garfinkel, Chih-Kang Eric Chen

Publication date: 1982

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230120310

zbMATH Keywords

algorithmexistencefacility locationdiameter of a graphgeneralized diameterpath of diameter length

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Inventory, storage, reservoirs (90B05) Paths and cycles (05C38)

Related Items (6)

Shortcut sets for plane Euclidean networks (extended abstract) ⋮ Computing optimal shortcuts for networks ⋮ Unnamed Item ⋮ The continuous center set of a network ⋮ Shortcut sets for the locus of plane Euclidean networks ⋮ Locating two obnoxious facilities using the weighted maximin criterion

Cites Work

• Unnamed Item

This page was built for publication: The generalized diameter of a graph