Search on high degree graphs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 266-271

  Walsh, Toby ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE GRAPHS; NARROW DISTRIBUTION; POWER LAW MODEL; RANDOM GRAPHS; REAL WORLD SEARCH; SMALL WORLD GRAPHS; SMALL WORLD MODEL; SMALL WORLD TOPOLOGY;

ARTIFICIAL INTELLIGENCE; GRAPHIC METHODS;

GRAPH THEORY;

EID: 84880871613     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. D. Achlioptas, C. Gomes, H. Kautz, and B. Selman. Generating satisfiable problem instances. In Proc. of 17th Nat. Conf. on AI. 2000.
2. A-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
3. A-L. Barabási, R. Albert, and H. Jeong. Mean-field theory for scale-free random networks. Physica A, 272:173-187, 1999. (Pubitemid 30499165)
4. D. Brelaz. New methods to color the vertices of a graph. Communications of ACM, 22:251-256, 1979. (Pubitemid 9452014)
5. J. Culberson and I.P. Gent. Frozen development in graph coloring. Theoretical Computer Science, 2001. To appear.
6. Masayuki Fujita, John Slaney, and Frank Bennett. Automatic generation of some results in finite algebra. In Proc. of the 13th IJCAI, pages 52-57. 1993.
7. I.P. Gent, H. Hoos, P. Prosser, and T. Walsh. Morphing: Combining structure and randomness. In Proc. of the 16th Nat. Conf. on AI. 1999.
8. C. Gomes, B. Selman, and N. Crato. Heavy-tailed distributions in combinatorial search. In G. Smolka, editor, Proc. of 3rd Int. Conf. on Principles and Practice of Constraint Programming (CP97), pages 121-135. Springer, 1997.
9. C. Gomes, B. Selman, K. McAloon, and C. Tretkoff. Randomization in backtrack search: Exploiting heavy-tailed profiles for solving hard scheduling problems. In The 4th International Conference on Artificial Intelligence Planning Systems (AIPS'98), 1998.
10. T. Hogg. Refining the phase transition in combinatorial search. Artificial Intelligence, 81(1-2):127-154, 1996. (Pubitemid 126349552)
11. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity for characteristic 'phase transitions'. Nature, 400:133-137, 1998.
12. A. Parkes. Clustering at the phase transition. In Proc. of the 14th Nat. Conf. on AI, pages 340-345. 1997.
13. S. Render. How popular is your paper? An empirical study of the citation distribution. European Physical Journal B, 4:131-134, 1998.
14. T. Walsh. Search in a small world. In Proceedings of 16th IJCAI. Artificial Intelligence, 1999.
15. D.J. Watts and S.H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998. (Pubitemid 28292183)