279 search results - page 39 / 56 » Matching Polynomials And Duality |
JGT
2006
13 years 7 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
CAL
2002
13 years 7 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
SMA
2008
ACM
13 years 7 months ago
2008
ACM
We convert any quad manifold mesh into an at least C1 surface consisting of bi-cubic tensor-product splines with localized perturbations of degree bi-5 near non-4-valent vertices....
SODA
2010
ACM
14 years 5 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...