A blossoming algorithm for tree volumes of composite digraphs

DOI10.1016/S0196-8858(03)00014-9MaRDI QIDQ1415380zbMATH OpenOpenAlexFDO

Authors Victor J. W. Guo

Publication date 3 December 2003

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-8858(03)00014-9

zbMATH Keywords

BijectionComposite digraphOriented tree volumeTree volume

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Parameterized algorithms for non-separating trees and branchings in digraphs
• scientific article; zbMATH DE number 867677
• A Blossom Algorithm for Maximum Edge-Disjoint T-Paths
• Treewidth computation and extremal combinatorics
• Treewidth Computation and Extremal Combinatorics
• An algorithm for the Tutte polynomials of graphs of bounded treewidth
• A constructive arboricity approximation scheme
• scientific article; zbMATH DE number 3917707
• Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth

Cites work

• Another Enumeration of Trees
• Bijections for Cayley trees, spanning trees, and their q-analogues
• Enumeration of spanning trees of certain graphs
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 841581 (Why is no real title available?)
• Spanning trees of extended graphs
• Une théorie combinatoire des séries formelles

This page was built for publication: A blossoming algorithm for tree volumes of composite digraphs

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