347 search results - page 44 / 70 » Schaefer's theorem for graphs |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
PODS
2004
ACM
15 years 9 months ago
2004
ACM
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
EJC
2008
14 years 9 months ago
2008
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
CAGD
2006
14 years 9 months ago
2006
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an ea...
ECCV
1998
Springer
15 years 11 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...