966 search results - page 50 / 194 » Small Alliances in Graphs |
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
SIGCOMM
2009
ACM
14 years 3 months ago
2009
ACM
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...
GD
1999
Springer
14 years 29 days ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
ISBI
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper develops an algorithm to detect abnormalities of small animals' transplanted hearts in MRI, at early stage of rejection when the hearts do not display prominent ab...