Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree.
Jonathan StokesSteven WeberPublished in: Inf. Process. Lett. (2018)
Keyphrases
- degree distribution
- scale free
- power law
- search algorithm
- greedy algorithm
- small world
- greedy heuristic
- clustering coefficient
- random graphs
- greedy algorithms
- complex networks
- social networks
- dynamic programming
- high density
- heuristic search
- graph theoretic
- graph theory
- graph clustering
- community structure
- building blocks
- approximation guarantees
- feature selection
- undirected graph
- maximum number
- graph representation
- weighted graph
- graph matching
- branch and bound
- heavy tailed