On the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching.
Natarajan MeghanathanPublished in: Comput. Inf. Sci. (2016)
Keyphrases
- graph matching
- independent set
- complex networks
- scale free
- dynamic networks
- degree distribution
- network structure
- network model
- communication networks
- real world networks
- spanning tree
- network traffic
- image matching
- pattern matching
- peer to peer
- network management
- scale free networks
- fully connected
- highly connected
- network topologies
- minimum distance
- small world
- power law
- object recognition
- community structure
- wireless sensor networks