88 search results - page 14 / 18 » The Secrecy Graph and Some of its Properties |
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
COCOON
2003
Springer
15 years 3 months ago
2003
Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
119
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
Social network services have become a viable source of information for users. In Twitter, information deemed important by the community propagates through retweets. Studying the c...
151
click to vote
3DIM
2007
IEEE
15 years 4 months ago
2007
IEEE
We propose an algorithm for surface reconstruction from unorganized points based on a view of the sampling process as a deformation from the original surface. In the course of thi...