A Heuristic Method of Generating Diameter 3 Graphs for Order/Degree Problem.
Teruaki KitasukaMasahiro IidaPublished in: CoRR (2016)
Keyphrases
- dynamic programming
- minimum spanning tree
- preprocessing
- generation method
- detection method
- graph matching
- combinatorial optimization
- segmentation method
- synthetic data
- data sets
- cost function
- significant improvement
- evolutionary algorithm
- pairwise
- hill climbing
- exhaustive search
- heuristic methods
- computational cost
- matching algorithm
- prior knowledge
- computational complexity
- feature selection
- neural network