Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph.
Mustapha AouchicheFrancis K. BellDragos M. CvetkovicPierre HansenPeter RowlinsonSlobodan K. SimicDragan StevanovicPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- graph theory
- minimum spanning tree
- variable neighborhood search
- weighted graph
- spanning tree
- graph model
- directed graph
- graph mining
- metaheuristic
- social network analysis
- graph structure
- tabu search
- undirected graph
- bipartite graph
- edge weights
- random walk
- heuristic methods
- directed acyclic graph
- traveling salesman problem
- cost function
- hybrid method
- complex networks
- shortest path
- simulated annealing
- evolutionary algorithm
- graph search
- lower bound