470 search results - page 20 / 94 » Local properties of geometric graphs |
105
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
JGT
2006
14 years 11 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...
146
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
104
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
Geometric active contours are formulated in a manner which is parametrization independent. As such, they are amenable to representation as the zero level set of the graph of a hig...
PAM
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...