Pages that link to "Item:Q5636925"
From MaRDI portal
The following pages link to A simple derivation of edmonds' algorithm for optimum branchings (Q5636925):
Displaying 12 items.
- On finding optimal polytrees (Q500966) (← links)
- Approximating optimum branchings in linear time (Q976065) (← links)
- Maximal dynamic polymatroid flows and applications (Q1077321) (← links)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
- Ranking arborescences in O(Km log n) time (Q1142709) (← links)
- Arborescence optimization problems solvable by Edmonds' algorithm (Q1399999) (← links)
- Estimating an oncogenetic tree when false negatives and positives are present (Q1603295) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← links)
- Approximating Transitive Reductions for Directed Networks (Q3183442) (← links)
- How to Sort by Walking on a Tree (Q3452827) (← links)
- APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM (Q4923297) (← links)
- Approximating the Spanning k-Tree Forest Problem (Q5321721) (← links)
