396 search results - page 6 / 80 » Exact Algorithms for Graph Homomorphisms |
AUSSOIS
2001
Springer
14 years 7 days ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
WALCOM
2008
IEEE
13 years 9 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
COLOGNETWENTE
2008
13 years 9 months ago
2008
ORL
2007
13 years 7 months ago
2007