35 search results - page 5 / 7 » mfcs 2007 |
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
A private information retrieval scheme is a protocol whereby a client obtains a record from a database without the database operators learning anything about which record the clien...
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...