1538 search results - page 99 / 308 » Spectral Techniques in Graph Algorithms |
122
click to vote
COMGEO
2004
ACM
15 years 1 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
111
click to vote
COMAD
2009
15 years 2 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
124
click to vote
PLDI
2011
ACM
14 years 4 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
ICCAD
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a post-placement physical synthesis algorithm that can apply multiple circuit synthesis and placement transforms on a placed circuit to improve the critical path delay ...
123
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...