99 search results - page 8 / 20 » Labeling planar graphs with a condition at distance two |
138
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
87
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
114
click to vote
DIALM
2005
ACM
15 years 3 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
141
Voted
DAM
2011
14 years 8 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
132
click to vote
MOBIHOC
2001
ACM
16 years 1 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...