Steiner distance stable graphs

DOI10.1016/0012-365X(94)90232-1zbMath0809.05042OpenAlexW2063390742MaRDI QIDQ1336650

Wayne Goddard, Henda C. Swart, Ortrud R. Oellermann

Publication date: 20 March 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90232-1

zbMATH Keywords

computational complexitySteiner distance stable grahs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Steiner 4-diameter, maximum degree and size of a graph, Steiner distance and convexity in graphs, Steiner diameter, maximum degree and size of a graph

Cites Work

• Steiner problem in networks: A survey
• An SST-based algorithm for the steiner problem in graphs
• Geodetic connectivity of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item