656 search results - page 99 / 132 » Graph Theoretical Characterization and Computation of Answer... |
SAC
2009
ACM
14 years 2 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
WG
2007
Springer
14 years 1 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
KR
2010
Springer
14 years 11 days ago
2010
Springer
In discrete dynamical systems change results from actions. As such, given a set of observations, diagnoses often take the form of posited events that result in the observed behavi...
ITICSE
2004
ACM
14 years 1 months ago
2004
ACM
Keeping students alert and responsive during lectures is a challenge even for experienced teachers in small group settings. Research has shown the importance of student participat...