3211 search results - page 107 / 643 » On the Grundy Number of a Graph |
PODS
1993
ACM
14 years 2 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
NIPS
2008
13 years 11 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
DM
1999
13 years 9 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
SIAMCOMP
1998
13 years 9 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...