5606 search results - page 374 / 1122 » Randomization Techniques for Graphs. |
186
click to vote
INFOVIS
2003
IEEE
15 years 12 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...
175
click to vote
APVIS
2006
15 years 8 months ago
2006
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...
204
click to vote
ICDAR
2011
IEEE
14 years 6 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 ...
197
click to vote
GD
1998
Springer
15 years 11 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
184
click to vote
ENTCS
2006
15 years 6 months ago
2006
Model transformation tools implemented using graph transformation techniques are often expected to provide high performance. For this reason, in the Graph Rewriting and Transforma...