Counting spanning trees using modular decomposition (Q2437761)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting spanning trees using modular decomposition |
scientific article; zbMATH DE number 6269532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting spanning trees using modular decomposition |
scientific article; zbMATH DE number 6269532 |
Statements
Counting spanning trees using modular decomposition (English)
0 references
13 March 2014
0 references
number of spanning trees
0 references
modular decomposition
0 references
Kirchhoff matrix tree theorem
0 references
linear-time algorithms
0 references
\((q,q-4)\)-graph
0 references
\(P_4\)-tidy graph
0 references
tree-cograph
0 references
0 references
0 references
0 references
0.9987590312957764
0 references
0.8525137901306152
0 references
0.7814209461212158
0 references
0.775113582611084
0 references
