The generalized diameter of a graph

DOI10.1002/NET.3230120310MaRDI QIDQ4747886zbMATH OpenOpenAlexFDO

Authors Chih-Kang Eric Chen, Robert Garfinkel

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

algorithmdiameter of a graphexistencefacility locationgeneralized diameterpath of diameter length

Mathematics Subject Classification ID

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

Cited in

(7)

• Computing optimal shortcuts for networks
• Shortcut sets for the locus of plane Euclidean networks
• Locating two obnoxious facilities using the weighted maximin criterion
• Computing optimal shortcuts for networks
• Shortcut sets for plane Euclidean networks (extended abstract)
• Algorithms for distance problems in continuous graphs
• The continuous center set of a network

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4747886)