Optimization of the directed spanning trees using the weighted matroid intersection algorithm

DOI10.1016/J.DAM.2026.07.027MaRDI QIDQ7317923zbMATH OpenFDO

Authors Binhong Jiang, Gehao Wang

Publication date 24 August 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2026.07.027

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Cites work

• A distributed algorithm for directed minimum-weight spanning tree
• A note on two problems in connexion with graphs
• A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
• A simple derivation of edmonds' algorithm for optimum branchings
• A weighted matroid intersection algorithm
• Arborescence problems in directed graphs: theorems and algorithms
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial optimization. Theory and algorithms
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Efficiently computing directed minimum spanning trees
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding optimum branchings
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• scientific article; zbMATH DE number 1953186 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3285076 (Why is no real title available?)
• scientific article; zbMATH DE number 3373559 (Why is no real title available?)
• Matroid intersection algorithms
• Matroid Intersection under Restricted Oracles
• Negative-cycle detection algorithms
• Network science. With Márton Pósfai
• On a routing problem
• Optimum branchings
• Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
• Two algorithms for weighted matroid intersection
• Updating Directed Minimum Cost Spanning Trees

This page was built for publication: Optimization of the directed spanning trees using the weighted matroid intersection algorithm

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