5606 search results - page 361 / 1122 » Randomization Techniques for Graphs. |
185
Voted
INFOVIS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
169
click to vote
ASSETS
2000
ACM
15 years 11 months ago
2000
ACM
Line graphs stand as an established information visualisation and analysis technique taught at various levels of difficulty according to standard Mathematics curricula. Blind indi...
153
click to vote
VISSYM
2007
15 years 9 months ago
2007
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, ...
160
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
- We address the problem of implication of assertion graphs that occur in generalized symbolic trajectory evaluation (GSTE). GSTE has demonstrated its powerful capacity in formal v...
153
click to vote
EJC
2010
15 years 6 months ago
2010
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...