Counting minimum weight arborescences

DOI10.1007/s00453-018-0426-5zbMath1401.05280OpenAlexW2792162407MaRDI QIDQ1799229

Satoru Iwata, Koyo Hayashi

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

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

Cites Work

• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Counting Minimum Weight Spanning Trees
• Packing rooted directed cuts in a weighted directed graph
• Optimum branchings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting minimum weight arborescences