Counting minimum weight arborescences

DOI10.1007/S00453-018-0426-5MaRDI QIDQ1799229zbMATH OpenOpenAlexFDO

Authors Koyo Hayashi, Satoru Iwata

Publication date 18 October 2018

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-018-0426-5

zbMATH Keywords

countingmatrix tree theoremminimum weight arborescence

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Finding minimal branchings with a given number of arcs
• Arborescence problems in directed graphs: theorems and algorithms
• scientific article; zbMATH DE number 7692724
• Minimum k arborescences with bandwidth constraints

Cites work

• Counting Minimum Weight Spanning Trees
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• scientific article; zbMATH DE number 5174567 (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?)
• Optimum branchings
• Packing rooted directed cuts in a weighted directed graph

Cited in

(7)

• Minimum k arborescences with bandwidth constraints
• The weighted arborescence constraint
• An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
• scientific article; zbMATH DE number 1080078 (Why is no real title available?)
• scientific article; zbMATH DE number 1931135 (Why is no real title available?)
• Finding minimal branchings with a given number of arcs
• scientific article; zbMATH DE number 1420748 (Why is no real title available?)

This page was built for publication: Counting minimum weight arborescences

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