Heuristic approaches to the maximization of the number of spanning trees in regular graphs (Q1840930)
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 approaches to the maximization of the number of spanning trees in regular graphs |
scientific article; zbMATH DE number 1567217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic approaches to the maximization of the number of spanning trees in regular graphs |
scientific article; zbMATH DE number 1567217 |
Statements
Heuristic approaches to the maximization of the number of spanning trees in regular graphs (English)
0 references
18 September 2001
0 references
evolutionary strategy
0 references
all terminal reliability
0 references
number of spanning trees
0 references
regular graphs
0 references
0.9155946969985962
0 references
0.7548670172691345
0 references
0.7453359365463257
0 references
0.7440573573112488
0 references
0.7249230742454529
0 references
