2310 search results - page 28 / 462 » Coloring Random Graphs |
GD
1995
Springer
13 years 11 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
ENDM
2000
13 years 7 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we present a simple colorization method that relies on nonlocal graph regularization. We introduce nonlocal discrete differential operators and a family of weighted ...
WEA
2004
Springer
14 years 1 months ago
2004
Springer
COMBINATORICS
2007
13 years 7 months ago
2007