New \(({\Delta{}}, D)\) graphs discovered by heuristic search

DOI10.1016/0166-218X(92)90120-YzbMath0768.05085OpenAlexW1519624348MaRDI QIDQ1199407

James R. A. Allwright

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90120-y

zbMATH Keywords

diameterheuristic algorithmmaximal graphsvalency\((\Delta,D)\) graph

Mathematics Subject Classification ID

Searching and sorting (68P10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• An Efficient Heuristic Procedure for Partitioning Graphs
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: New \(({\Delta{}}, D)\) graphs discovered by heuristic search