2503 search results - page 40 / 501 » A study of 3-arc graphs |
197
click to vote
ECCC
2007
15 years 5 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
149
click to vote
CPC
2010
15 years 3 months ago
2010
We study the diameter of C1, the largest component of the Erdos-R
159
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
150
click to vote
LICS
2007
IEEE
16 years 1 days ago
2007
IEEE
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
178
click to vote
CCS
2010
ACM
15 years 4 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...