Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree.
Jonathan StokesSteven WeberPublished in: CoRR (2017)
Keyphrases
- degree distribution
- scale free
- search algorithm
- power law
- small world
- complex networks
- greedy heuristic
- clustering coefficient
- greedy algorithm
- greedy algorithms
- social networks
- building blocks
- random graphs
- graph matching
- integrated circuit
- biological networks
- heuristic search
- heavy tailed
- search space
- high density
- graph theoretic
- feature selection
- maximum number
- heuristic methods
- network model
- branch and bound
- tabu search
- dynamic programming
- np hard
- evolutionary algorithm