1188 search results - page 56 / 238 » Extended Graph Unification |
90
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
The extended abstract describes a method for recognizing similar sub-parts of objects described by 3D polygonal meshes. The innovation of this method is the coupling of structure a...
107
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
103
click to vote
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
GG
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
103
Voted
OPODIS
2008
15 years 2 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...