A Heuristic Method of Generating Diameter 3 Graphs for Order/Degree Problem
Data Structures and Algorithms
2016-10-10 v1
Abstract
We propose a heuristic method that generates a graph for order/degree problem. Target graphs of our heuristics have large order (> 4000) and diameter 3. We describe the ob- servation of smaller graphs and basic structure of our heuristics. We also explain an evaluation function of each edge for efficient 2-opt local search. Using them, we found the best solutions for several graphs.
Cite
@article{arxiv.1609.03136,
title = {A Heuristic Method of Generating Diameter 3 Graphs for Order/Degree Problem},
author = {Teruaki Kitasuka and Masahiro Iida},
journal= {arXiv preprint arXiv:1609.03136},
year = {2016}
}
Comments
Proceedings of 10th IEEE/ACM International Symposium on Networks-on-Chip, Nara, Japan, Aug. 2016