396 search results - page 4 / 80 » Exact Algorithms for Graph Homomorphisms |
CORR
2008
Springer
13 years 7 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 ...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
SIAMCOMP
2008
13 years 7 months ago
2008
We show that the treewidth and the minimum fill-in of an n-vertex graph can be
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs
EOR
2008
13 years 7 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...