4201 search results - page 82 / 841 » Interaction graphs: Additives |
157
Voted
SIMVIS
2004
15 years 5 months ago
2004
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
147
click to vote
CPC
2007
15 years 4 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...
140
click to vote
DM
1999
15 years 3 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
128
Voted
TVCG
2010
15 years 2 months ago
2010
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
157
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...