Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences

DOI10.1137/1.9781611974324.10zbMath1433.05161arXiv1507.07727OpenAlexW2963087696MaRDI QIDQ5194946

Przemysław Uznański, Matúš Mihalák, Pencho Yordanov

Publication date: 17 September 2019

Published in: 2016 Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.07727

zbMATH Keywords

Kirchhoff polynomialrooted directed spanning trees

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ Unnamed Item

This page was built for publication: Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences