Sciweavers

396 search results - page 2 / 80
» Exact Algorithms for Graph Homomorphisms
Sort
View
PVLDB
2010
110views more  PVLDB 2010»
13 years 3 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
AAIM
2005
Springer
173views Algorithms» more  AAIM 2005»
13 years 10 months ago
Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs
Gregory Gutin, Arash Rafiey, Anders Yeo, Michael T...
ICIP
2003
IEEE
14 years 6 months ago
Graph-based object tracking
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
Cristina Gomila, Fernand Meyer
DM
2006
82views more  DM 2006»
13 years 5 months ago
On the extension of vertex maps to graph homomorphisms
A reflexive graph is a simple undirected graph where a loop has been added at each vertex. If G and H are reflexive graphs and U V (H), then a vertex map f : U V (G) is called n...
Geir Agnarsson, Li Chen
SIAMDM
2008
190views more  SIAMDM 2008»
13 years 5 months ago
On the Complexity of Ordered Colorings
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...