Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414)
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 2041897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures |
scientific article; zbMATH DE number 2041897 |
Statements
Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (English)
0 references
14 February 2004
0 references
Graph
0 references
Conjecture
0 references
Automated system
0 references
0.9406622052192688
0 references
0.9187312126159668
0 references
0.9005164504051208
0 references
0.8876336216926575
0 references
