Sciweavers

86 search results - page 12 / 18
» Homomorphisms of 2-edge-colored graphs
Sort
View
STACS
2010
Springer
14 years 1 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
CONCUR
2001
Springer
14 years 1 months ago
A Static Analysis Technique for Graph Transformation Systems
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produ...
Paolo Baldan, Andrea Corradini, Barbara König
SIBGRAPI
2007
IEEE
14 years 2 months ago
Graph-based Object Tracking Using Structural Pattern Recognition
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...
Ana Beatriz V. Graciano, Roberto Marcondes Cesar J...
JGT
2008
97views more  JGT 2008»
13 years 8 months ago
On the oriented chromatic index of oriented graphs
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
Pascal Ochem, Alexandre Pinlou, Eric Sopena
DAM
2008
102views more  DAM 2008»
13 years 8 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...