202 search results - page 17 / 41 » Locally identifying coloring of graphs |
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
114
click to vote
IWOCA
2010
Springer
14 years 6 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—In road networks, sensors are deployed sparsely (hundreds of meters apart) to save costs. This makes the existing localization solutions based on the ranging be ineffect...
113
click to vote
WAOA
2010
Springer
14 years 9 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
114
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose a method to identify and localize object
classes in images. Instead of operating at the pixel level,
we advocate the use of superpixels as the basic unit of a
class s...