On recursive computation of minimum spanning trees for special partial graphs

DOI10.1080/02331938508842986zbMath0572.90099OpenAlexW2066266916MaRDI QIDQ3690607

Guntram Scheithauer

Publication date: 1985

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938508842986

zbMATH Keywords

minimum spanning treeundirected graphsymmetric traveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Minimal Test Set for Diagnosing a Tree System
• Finding Minimum Spanning Trees
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: On recursive computation of minimum spanning trees for special partial graphs