617 search results - page 69 / 124 » On the Chromatic Number of Random Graphs |
FUIN
2006
14 years 12 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
111
click to vote
AUSAI
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
110
click to vote
ADHOCNOW
2005
Springer
15 years 5 months ago
2005
Springer
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
123
click to vote
ADHOCNOW
2004
Springer
15 years 5 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...