Enumeration of spanning trees in planar unclustered networks (Q1782858)
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: Enumeration of spanning trees in planar unclustered networks |
scientific article; zbMATH DE number 6939995
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of spanning trees in planar unclustered networks |
scientific article; zbMATH DE number 6939995 |
Statements
Enumeration of spanning trees in planar unclustered networks (English)
0 references
20 September 2018
0 references
complex networks
0 references
spanning trees
0 references
computational complexity
0 references
planar networks
0 references
0 references
0.8416255712509155
0 references
0.824461817741394
0 references
0.8220732808113098
0 references
0.8202425241470337
0 references
0.8178866505622864
0 references
