396 search results - page 9 / 80 » Exact Algorithms for Graph Homomorphisms |
SIBGRAPI
2007
IEEE
14 years 2 months ago
2007
IEEE
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...
COR
2006
13 years 7 months ago
2006
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
ESA
2003
Springer
14 years 29 days ago
2003
Springer
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...