Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123277778, #quickstatements; #temporary_batch_1706881316814 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: nauty / rank | |||
Normal rank | |||
Revision as of 10:56, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures |
scientific article |
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
