1538 search results - page 129 / 308 » Spectral Techniques in Graph Algorithms |
117
click to vote
ALT
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
121
Voted
PAAPP
2000
15 years 1 months ago
2000
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
GD
2005
Springer
15 years 7 months ago
2005
Springer
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
IH
2007
Springer
15 years 7 months ago
2007
Springer
The recent decade has seen the emergence of 3D meshes in industrial, medical and entertainment applications. Therefore, their intellectual property protection problem has attracted...