Sciweavers

23 search results - page 2 / 5
» csr 2009
Sort
View
48
Voted
CSR
2009
Springer
15 years 4 months ago
Formal Verification of Gate-Level Computer Systems
Mark A. Hillebrand, Sergey Tverdyshev
63
Voted
CSR
2009
Springer
15 years 4 months ago
Approximability Distance in the Space of H-Colourability Problems
Tommy Färnqvist, Peter Jonsson, Johan Thapper
70
Voted
CSR
2009
Springer
15 years 4 months ago
The Budgeted Unique Coverage Problem and Color-Coding
Neeldhara Misra, Venkatesh Raman, Saket Saurabh, S...
86
Voted
CSR
2009
Springer
15 years 1 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
77
Voted
CSR
2009
Springer
15 years 4 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