5100 search results - page 300 / 1020 » The Linear Complexity of a Graph |
132
click to vote
AAAI
1996
15 years 5 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
123
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We use support theory, in particular the fretsaw extensions of Shklarski and Toledo [ST06a], to design preconditioners for the stiffness matrices of 2-dimensional truss structure...
157
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
229
click to vote
CPC
2007
15 years 4 months ago
2007
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
137
click to vote
IPL
2007
15 years 4 months ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...