Sciweavers

23 search results - page 2 / 5
» csr 2009
Sort
View
CSR
2009
Springer
14 years 2 months ago
Approximability Distance in the Space of H-Colourability Problems
Tommy Färnqvist, Peter Jonsson, Johan Thapper
CSR
2009
Springer
14 years 2 months ago
The Budgeted Unique Coverage Problem and Color-Coding
Neeldhara Misra, Venkatesh Raman, Saket Saurabh, S...
CSR
2009
Springer
13 years 11 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas
CSR
2009
Springer
14 years 2 months ago
New Plain-Exponential Time Classes for Graph Homomorphism
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...
Magnus Wahlström