1425 search results - page 71 / 285 » Beyond Dependency Graphs |
Publication
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
COMBINATORICA
2010
13 years 3 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
DAGSTUHL
2000
13 years 9 months ago
2000
Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understa...
JOSS
2000
13 years 7 months ago
2000
: Data structures comprising many binary variables can be represented graphically in various ways. Depending on the purpose different plots might be useful. Here two ways of showin...