On the spanning trees of weighted graphs

DOI10.1007/3-540-50728-0_58MaRDI QIDQ6199477

C. Greg Plaxton, Ernst W. Mayr

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Maximum of k-th maximal spanning trees of a weighted graph
• Lower Bounds for Selection in X + Y and Other Multisets
• Fibonacci heaps and their uses in improved network optimization algorithms
• Systems of distinct representatives and linear algebra
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem