pp 1–12 | Cite as

Counting Minimum Weight Arborescences



In a directed graph \(D = (V, A)\) with a specified vertex \(r \in V\), an arc subset \(B \subseteq A\) is called an r-arborescence if B has no arc entering r and there is a unique path from r to v in (VB) for each \(v \in V \backslash \{ r \}\). The problem of finding a minimum weight r-arborescence in a weighted digraph has been studied for decades starting with Chu and Liu (Sci Sin 14:1396–1400, 1965), Edmonds (J Res Natl Bur Stand 71B:233–240, 1967) and Bock (Developments in operations research, Gordon and Breach, New York, pp 29–44, 1971). In this paper, we focus on the number of minimum weight arborescences. We present an algorithm for counting minimum weight r-arborescences in \(O(n^{\omega })\) time, where n is the number of vertices of an input digraph and \(\omega \) is the matrix multiplication exponent.


Minimum weight arborescence Matrix tree theorem Counting 


  1. 1.
    Bock, F.: An algorithm to construct a minimum directed spanning tree in a directed network. In: Avi-Itzhak, B. (ed.) Developments in Operations Research, pp. 29–44. Gordon and Breach, New York (1971)Google Scholar
  2. 2.
    Broder, A.Z., Mayr, E.W.: Counting minimum weight spanning trees. J. Algorithms 24, 171–176 (1997)MathSciNetMATHGoogle Scholar
  3. 3.
    Chu, Y., Liu, T.: On the shortest arborescence of a directed graph. Sci. Sin. 14, 1396–1400 (1965)MathSciNetMATHGoogle Scholar
  4. 4.
    Edmonds, J.: Optimal branchings. J. Res. Natl. Bur. Stand. 71B, 233–240 (1967)MATHGoogle Scholar
  5. 5.
    Fulkerson, D.R.: Packing rooted directed cuts in a weighted directed graph. Math. Program. 6, 1–13 (1974)MathSciNetMATHGoogle Scholar
  6. 6.
    Gabow, H.N., Galil, Z., Spencer, T., Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatrica 6, 109–122 (1986)MathSciNetMATHGoogle Scholar
  7. 7.
    Lovász, L.: Combinatorial Problems and Exercises, 2nd edn. AMS Chelsea Publishing, Providence (2007)MATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Mathematical InformaticsUniversity of TokyoTokyoJapan

Personalised recommendations