Search on High Degree Graphs

We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study some alternative models for randomly generating graphs which have been proposed to give more realistic topologies. For example, we show that Watts and Strogatz's small world model has a narrow distribution of node degree. On the other hand, Barab

• Type: Conference
• Year: 2001
• Where: IJCAI
• Authors: Toby Walsh
• Keywords: IJCAI 2001, IJCAI 2007, Random Graphs, Small World, Small World Topology