Graph Minors from Simulated Annealing for Annealing Machines with Sparse Connectivity.
Yuya SugieYuki YoshidaNormann MertigTakashi TakemotoHiroshi TeramotoAtsuyoshi NakamuraIchigaku TakigawaShin-ichi MinatoMasanao YamaokaTamiki KomatsuzakiPublished in: TPNC (2018)
Keyphrases
- simulated annealing
- connected components
- metaheuristic
- evolutionary algorithm
- tabu search
- genetic algorithm
- simulated annealing algorithm
- combinatorial optimization
- graph theory
- gaussian graphical models
- genetic algorithm ga
- hill climbing
- graph structure
- graph connectivity
- global optimum
- sparse data
- high dimensional
- structured data
- graph matching
- graph representation
- graph databases
- graph model
- stochastic search
- directed graph
- directed acyclic graph
- optimization method
- solution quality
- elastic net
- strongly connected
- topological information
- graph search
- directed acyclic
- weighted graph
- graph theoretic
- random walk
- markov random field
- small world
- spanning tree
- link analysis
- bipartite graph
- sparse representation
- graph based algorithm
- semi supervised
- feature selection