5100 search results - page 18 / 1020 » The Linear Complexity of a Graph |
GD
2005
Springer
14 years 1 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
ECCV
1998
Springer
14 years 8 hour ago
1998
Springer
This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of e...
UAI
2004
13 years 9 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
FOCS
2002
IEEE
14 years 22 days 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)....
APVIS
2007
13 years 9 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...