Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph.
Pierre HansenHadrien MélotPublished in: Graphs and Discovery (2001)
Keyphrases
- variable neighborhood search
- minimum spanning tree
- graph theory
- spanning tree
- weighted graph
- directed graph
- traveling salesman problem
- graph structure
- graph model
- graph databases
- edge weights
- social network analysis
- metaheuristic
- graph mining
- bipartite graph
- graph search
- tabu search
- upper bound
- hybrid method
- complex networks
- shortest path
- combinatorial optimization
- graphical models
- np complete
- routing problem
- undirected graph
- heuristic methods
- neural network
- benchmark instances
- single machine scheduling problem
- objective function