4009 search results - page 349 / 802 » Clustering on Complex Graphs |
158
click to vote
COMPGEOM
2004
ACM
16 years 6 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
190
click to vote
INFOVIS
2003
IEEE
16 years 2 days ago
2003
IEEE
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
154
Voted
ICTAI
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...
205
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
183
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...