2310 search results - page 115 / 462 » Coloring Random Graphs |
115
click to vote
ENDM
2006
15 years 2 months ago
2006
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
101
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
104
Voted
ICIAP
2003
ACM
15 years 7 months ago
2003
ACM
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
110
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
103
click to vote
IJCAI
2001
15 years 3 months ago
2001
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 ...