Sciweavers

656 search results - page 92 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee
ECCC
2006
145views more  ECCC 2006»
14 years 9 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
DM
2010
124views more  DM 2010»
14 years 7 months ago
Perfect dodecagon quadrangle systems
A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x1, x2, ..., x12) and a 4-cycle (x1, x4, x7, x10). A dodecagon quadrangle system of order n and index [D...
Lucia Gionfriddo, Mario Gionfriddo
ESOP
1990
Springer
15 years 1 months ago
Algebraic Properties of Program Integration
The need to integrate several versions of a program into a common one arises frequently, but it is a tedious and time consuming task to merge programs by hand. The program-integrat...
Thomas W. Reps
FOCS
1994
IEEE
15 years 1 months ago
Randomized and deterministic algorithms for geometric spanners of small diameter
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid