1067 search results - page 19 / 214 » Probabilistic regular graphs |
COMPGEOM
2007
ACM
15 years 4 months ago
2007
ACM
CPC
2007
15 years 12 days ago
2007
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
80
Voted
ECHT
1992
15 years 4 months ago
1992
We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels are used to qualify connected subgraphs. An algebraic language base...
109
click to vote
COMBINATORICS
2006
15 years 14 days ago
2006
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
COLT
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...