4865 search results - page 659 / 973 » The Complexity of Graph Connectivity |
140
click to vote
SP
1998
IEEE
15 years 9 months ago
1998
IEEE
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
116
click to vote
SPAA
1997
ACM
15 years 9 months ago
1997
ACM
: This paper presents a network mapping algorithm and proves its correctness assuming a traffic-free network. Respecting well-defined parameters, the algorithm produces a graph iso...
152
click to vote
PDIS
1996
IEEE
15 years 9 months ago
1996
IEEE
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
155
click to vote
KDD
1997
ACM
15 years 9 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
124
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...