2310 search results - page 171 / 462 » Coloring Random Graphs |
118
click to vote
DM
1999
15 years 2 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 ...
124
click to vote
IV
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
107
click to vote
RSA
2008
15 years 1 months ago
2008
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...
106
Voted
WAW
2009
Springer
15 years 9 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
143
click to vote
VIS
2004
IEEE
16 years 3 months ago
2004
IEEE
Although luminance contrast plays a predominant role in motion perception, significant additional effects are introduced by chromatic contrasts. In this paper, relevant results fr...