Morphing: combining structure and randomness
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
New methods to color the vertices of a graph
Communications of the ACM
Frozen development in graph coloring
Theoretical Computer Science - Phase transitions in combinatorial problems
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Generating Satisfiable Problem Instances
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Clustering at the phase transition
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
Machine Learning
An Investigation of Variable Relationships in 3-SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Criticality and Parallelism in Structured SAT Instances
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Emergence of coordination in scale-free networks
Web Intelligence and Agent Systems
A Multi-Agent Approach for Peer-to-Peer Based Information Retrieval System
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Knowledge base reuse through constraint relaxation
Proceedings of the 3rd international conference on Knowledge capture
DC-SSAT: a divide-and-conquer approach to solving stochastic satisfiability problems efficiently
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Breaking instance-independent symmetries in exact graph coloring
Journal of Artificial Intelligence Research
Optimal refutations for constraint satisfaction problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On the structure of industrial SAT instances
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
An Empirical Study of the Manipulability of Single Transferable Voting
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Concurrency and network disassortativity
Artificial Life
Is computational complexity a barrier to manipulation?
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
On the impact of small-world on local search
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Is computational complexity a barrier to manipulation?
Annals of Mathematics and Artificial Intelligence
Effect of DisCSP variable-ordering heuristics in scale-free networks
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Where are the hard manipulation problems?
Journal of Artificial Intelligence Research
Effect of DisCSP variable-ordering heuristics in scale-free networks
Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems
| Hi-index | 0.00 |
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ási and Albert's power law model, gives graphs with both nodes of high degree and a small world topology. These graphs may therefore be useful for benchmarking. We then measure the impact of nodes of high degree and a small world topology on the cost of coloring graphs. The long tail in search costs observed with small world graphs disappears when these graphs are also constructed to contain nodes of high degree. We conjecture that this is a result of the small size of their "backbone", pairs of edges that are frozen to be the same color.