On finding most uniform spanning trees

DOI10.1016/0166-218X(88)90062-5zbMath0645.05035MaRDI QIDQ1102979

Baruch Schieber, Zvi Galil

Publication date: 1988

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

zbMATH Keywords

algorithmspanning treeweighted graph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (16)

Minimum dispersion problems ⋮ On discrete optimization with ordering ⋮ The balanced traveling salesman problem ⋮ A branch-and-cut algorithm for the balanced traveling salesman problem ⋮ Balanced Optimization with Vector Costs ⋮ COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES ⋮ Constrained balanced optimization problems ⋮ An inverse model for the most uniform problem ⋮ Lexicographic balanced optimization problems ⋮ Quadratic bottleneck problems ⋮ Robust balanced optimization ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ Unnamed Item ⋮ An \(O(m\log n)\) algorithm for the max+sum spanning tree problem ⋮ The minimum labeling spanning trees ⋮ The quadratic balanced optimization problem

Cites Work

• Unnamed Item
• Most and least uniform spanning trees
• A data structure for dynamic trees

This page was built for publication: On finding most uniform spanning trees