86 search results - page 7 / 18 » Homomorphisms of 2-edge-colored graphs |
ICPR
2000
IEEE
16 years 22 days ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
106
click to vote
EJC
2008
14 years 11 months ago
2008
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
114
click to vote
EJC
2008
14 years 11 months ago
2008
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
103
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...