Countingk-component forests of a graph
\(k\)-component spanning forestsasymptotic time complexityconnected spanning unicyclic subgraphs of a planar graphmatroid duality
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Reliability, availability, maintenance, inspection in operations research (90B25) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth
- On Operator and Formal Sum Methods for Graph Enumeration Problems
- Computing the number of h-edge spanning forests in complete bipartite graphs
- scientific article; zbMATH DE number 3966096
- Linear algebraic techniques for spanning tree enumeration
- On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph
- Forest matrices around the Laplacian matrix
- Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth
- scientific article; zbMATH DE number 2186866 (Why is no real title available?)
- A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
- Fast sequential importance sampling to estimate the graph reliability polynomial
- A combinatorial approach to Golomb forests
- Bizonotopal graphical algebras
- Forest decompositions of graphs with cyclomatic number 3
- Random two-component spanning forests
This page was built for publication: Countingk-component forests of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022730)
