1201 search results - page 103 / 241 » Linear Probing and Graphs |
122
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...
127
click to vote
ACSAC
2006
IEEE
15 years 10 months ago
2006
IEEE
Attack graphs are a valuable tool to network defenders, illustrating paths an attacker can use to gain access to a targeted network. Defenders can then focus their efforts on patc...
228
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...
132
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...
139
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...