3267 search results - page 326 / 654 » Generalized quasirandom graphs |
214
click to vote
SASO
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
183
click to vote
CIKM
2007
Springer
16 years 1 months ago
2007
Springer
We present Paged Graph Visualization (PGV), a new semiautonomous tool for RDF data exploration and visualization. PGV consists of two main components: a) the “PGV explorer” an...
206
click to vote
COCOA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
208
click to vote
MOBICOM
2006
ACM
16 years 1 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
209
click to vote
SIGECOM
2006
ACM
16 years 1 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...