151 search results - page 12 / 31 » Hyperbolic Graphs of Small Complexity |
204
click to vote
ICDE
2002
IEEE
16 years 1 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
CVPR
1999
IEEE
16 years 1 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
GD
2003
Springer
15 years 4 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
117
Voted
FOCS
2002
IEEE
15 years 4 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)....