22 search results - page 1 / 5 » Distributed Game-Theoretic Vertex Coloring |
OPODIS
2010
13 years 8 months ago
2010
PODC
2010
ACM
14 years 2 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
ISTCS
1993
Springer
14 years 2 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
HPCC
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...