On finding most uniform spanning trees

DOI10.1016/0166-218X(88)90062-5zbMATH Open0645.05035MaRDI QIDQ1102979FDOQ1102979

Authors: Baruch Schieber, Zvi Galil 

Publication date: 1988

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

Recommendations

• Most and least uniform spanning trees
• Uniform spanning trees on Sierpiński graphs
• scientific article; zbMATH DE number 953290
• Choosing a spanning tree for the integer lattice uniformly
• On finding spanning trees with few leaves
• On the SPANNING \(k\)-TREE problem
• scientific article; zbMATH DE number 1123757
• An almost-linear time algorithm for uniform random spanning tree generation
• scientific article; zbMATH DE number 4156450

zbMATH Keywords

algorithmspanning treeweighted graph

Mathematics Subject Classification ID

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

Cites Work

• A data structure for dynamic trees
• Title not available (Why is that?)
• Most and least uniform spanning trees

Cited In (23)

• Minimum dispersion problems
• Lexicographic balanced optimization problems
• Balanced Optimization with Vector Costs
• Computing fair and bottleneck matchings in geometric graphs
• Quadratic bottleneck problems
• High Spies (or How to Win a Programming Contest)
• Ordered weighted average optimization in multiobjective spanning tree problem
• Uniform tree approximation by global optimization techniques
• Title not available (Why is that?)
• The balanced traveling salesman problem
• An \(O(m\log n)\) algorithm for the max+sum spanning tree problem
• Most and least uniform spanning trees
• Finding the seed of uniform attachment trees
• Rooted Uniform Monotone Minimum Spanning Trees
• The minimum labeling spanning trees
• Constrained balanced optimization problems
• An inverse model for the most uniform problem
• On discrete optimization with ordering
• COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES
• Robust balanced optimization
• A branch-and-cut algorithm for the balanced traveling salesman problem
• Title not available (Why is that?)
• The quadratic balanced optimization problem

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

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