Counting spanning trees in cographs: an algorithmic approach (Q3073568)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5850544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting spanning trees in cographs: an algorithmic approach |
scientific article; zbMATH DE number 5850544 |
Statements
11 February 2011
0 references
\(P_{4}\)-reducible graph
0 references
number of spanning tree
0 references
modular decomposition
0 references
complexity
0 references
0.8552688956260681
0 references
0.8525137901306152
0 references
0.7624077200889587
0 references
0.761978030204773
0 references
