718 search results - page 107 / 144 » Coloring quasi-line graphs |
146
click to vote
ADHOCNOW
2004
Springer
15 years 7 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
134
click to vote
GD
1995
Springer
15 years 5 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...
137
click to vote
TVCG
2008
15 years 1 months ago
2008
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
128
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...
102
click to vote
WETICE
1996
IEEE
15 years 6 months ago
1996
IEEE
The Multi-Head, Multi-Tail, Multi-Client (MMM) Browsing Project is a continuing effort to bring stronger graph semantics to the World Wide Web thereby increasing the Web's us...