A simple derivation of edmonds' algorithm for optimum branchings

DOI10.1002/NET.3230010305MaRDI QIDQ5636925zbMATH OpenOpenAlexFDO

Authors Richard Karp

Publication date 1972

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230010305

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Applications of graph theory (05C90)

Cites work

• Optimum branchings

Cited in

(14)

• Maximal dynamic polymatroid flows and applications
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Ranking arborescences in O(Km log n) time
• Arborescence optimization problems solvable by Edmonds' algorithm
• Estimating an oncogenetic tree when false negatives and positives are present
• How to sort by walking and swapping on paths and trees
• Approximating Transitive Reductions for Directed Networks
• How to sort by walking on a tree
• Approximating the spanning k-tree forest problem
• On finding optimal polytrees
• Approximating the Spanning k-Tree Forest Problem
• scientific article; zbMATH DE number 7692724 (Why is no real title available?)
• Optimization of the directed spanning trees using the weighted matroid intersection algorithm
• Approximating optimum branchings in linear time

This page was built for publication: A simple derivation of edmonds' algorithm for optimum branchings

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