Maximum of k-th maximal spanning trees of a weighted graph

DOI10.1007/BF02579450zbMath0624.05027OpenAlexW2069230977MaRDI QIDQ1092057

B. George

Publication date: 1987

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579450

zbMATH Keywords

weighted graphspanning trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (11)

Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems ⋮ A solution to one of Kano's conjectures concerning k-th maximal spanning trees ⋮ Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem ⋮ Randomized local search, evolutionary algorithms, and the minimum spanning tree problem ⋮ Partitioning bispanning graphs into spanning trees ⋮ Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem ⋮ Multiplicative drift analysis ⋮ On the spanning trees of weighted graphs ⋮ On the spanning trees of weighted graphs ⋮ Weight distribution of the bases of a matroid ⋮ Weight distribution of the bases of a binary matroid

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• On Representatives of Subsets
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum of k-th maximal spanning trees of a weighted graph