New \(({\Delta{}}, D)\) graphs discovered by heuristic search (Q1199407): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank | |||
Normal rank | |||
Latest revision as of 16:15, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New \(({\Delta{}}, D)\) graphs discovered by heuristic search |
scientific article |
Statements
New \(({\Delta{}}, D)\) graphs discovered by heuristic search (English)
0 references
16 January 1993
0 references
heuristic algorithm
0 references
\((\Delta,D)\) graph
0 references
maximal graphs
0 references
valency
0 references
diameter
0 references
