1538 search results - page 123 / 308 » Spectral Techniques in Graph Algorithms |
109
Voted
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
122
click to vote
ISCAPDCS
2003
15 years 2 months ago
2003
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
133
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...
187
click to vote
ICDE
2000
IEEE
16 years 2 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
106
click to vote
IFIP12
2007
15 years 3 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...