A memory-efficient heuristic for maximum matching in scale-free networks.
Upul SenanayakeMahendra PiraveenanPublished in: ASONAM (2016)
Keyphrases
- memory efficient
- maximum matching
- scale free networks
- bipartite graph
- iterative deepening
- complex networks
- scale free
- stable set
- network topologies
- search algorithm
- small world networks
- link prediction
- complex systems
- optimal solution
- social network analysis
- simulated annealing
- search strategies
- power law distribution
- constraint satisfaction
- shortest path
- real world networks
- tabu search