2612 search results - page 194 / 523 » Switching Graphs and Their Complexity |
137
click to vote
INFOVIS
2003
IEEE
15 years 9 months 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...
119
click to vote
ICTAI
2000
IEEE
15 years 8 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...
165
click to vote
IPPS
1998
IEEE
15 years 8 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...
129
click to vote
SIAMDM
2008
15 years 4 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...
168
click to vote
ICDAR
2011
IEEE
14 years 4 months ago
2011
IEEE
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...