On the hardness of optimization in power-law graphs.
Alessandro FerranteGopal PanduranganKihong ParkPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- power law
- small world
- power laws
- real world graphs
- random graphs
- degree distribution
- scale free
- learning curves
- optimization algorithm
- long range correlations
- power law distribution
- np complete
- np hard
- computational complexity
- worst case
- graph databases
- graph mining
- directed graph
- combinatorial optimization
- information theoretic
- preferential attachment
- social networks