On the spanning trees of weighted graphs

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

Authors: Ernst W. Mayr, C. Greg Plaxton 

Publication date: 28 February 2024

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

Recommendations

• On the spanning trees of weighted graphs
• Weight distribution of the bases of a matroid
• A solution to one of Kano's conjectures concerning k-th maximal spanning trees
• Maximum of k-th maximal spanning trees of a weighted graph
• Partitioning bispanning graphs into spanning trees

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: On the spanning trees of weighted graphs

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