New (Δ,D) graphs discovered by heuristic searchµ

0.00 Avg rating—0 Votes

Article ID:	iaor1993620
Country:	Netherlands
Volume:	37/38
Issue:	1/5
Start Page Number:	3
End Page Number:	8
Publication Date:	Jul 1992
Journal:	Discrete Applied Mathematics
Authors:	Allwright James
Keywords:	heuristics

Abstract:

A heuristic algorithm for the (ℝ,D) graph problem is outlined, and new maximal graphs discovered with it, of size 41 for valency 4 and diameter 3, are described.

Reviews

Required fields are marked *. Your email address will not be published.