Heuristic maximization of the number of spanning trees in regular graphs (Q855940)
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: Heuristic maximization of the number of spanning trees in regular graphs |
scientific article; zbMATH DE number 5078295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic maximization of the number of spanning trees in regular graphs |
scientific article; zbMATH DE number 5078295 |
Statements
Heuristic maximization of the number of spanning trees in regular graphs (English)
0 references
7 December 2006
0 references
\(t\)-optimal graph
0 references
regular graphs
0 references
spanning tree
0 references
discrete optimization
0 references
evolutionary algorithm
0 references
2-optimal algorithm
0 references
0 references
0 references
0 references
0.9155946969985962
0 references
0.7999560236930847
0 references
0.7960478663444519
0 references
0.789850652217865
0 references
0.7842164039611816
0 references
