Sciweavers

98 search results - page 9 / 20
» An agent-based algorithm for generalized graph colorings
Sort
View
ATAL
2005
Springer
14 years 1 months ago
A simulator for multi-agent partnership formation based on dependence graphs
The PartNET++ system is an experimental multi-agent-based simulation tool that uses a new model based on hyper-graphs for understanding partnership formation among heterogeneous a...
Júlio de Lima do Rêgo Monteiro, Jaime...
COCOON
2003
Springer
14 years 21 days ago
Graph Coloring and the Immersion Order
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Faisal N. Abu-Khzam, Michael A. Langston
IWCMC
2009
ACM
14 years 4 days ago
Graph coloring based physical-cell-ID assignment for LTE networks
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
Tobias Bandh, Georg Carle, Henning Sanneck
EJC
2008
13 years 7 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
29
Voted
PODC
2010
ACM
13 years 11 months ago
Deterministic distributed vertex coloring in polylogarithmic time
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...
Leonid Barenboim, Michael Elkin