Sciweavers

684 search results - page 50 / 137
» A characterization of b-perfect graphs
Sort
View
DM
2006
82views more  DM 2006»
15 years 1 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
EJC
2008
15 years 1 months ago
Locally constrained graph homomorphisms and equitable partitions
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
Jirí Fiala, Daniël Paulusma, Jan Arne ...
144
Voted
JGAA
2007
135views more  JGAA 2007»
15 years 1 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
106
Voted
ICPR
2000
IEEE
15 years 6 months ago
A Graph-Based Global Registration for 2D Mosaics
We describe a graph-based global registration method for creating 2D mosaic images. When multi-frames overlap in space, global registration is necessary to minimize the accumulate...
Eun-Young Kang, Isaac Cohen, Gérard G. Medi...
115
Voted
ICPR
2010
IEEE
15 years 3 months ago
Lipreading: A Graph Embedding Approach
In this paper, we propose a novel graph embedding method for the problem of lipreading. To characterize the temporal connections among video frames of the same utterance, a new di...
Ziheng Zhou, Guoying Zhao, Matti Pietikäinen