4865 search results - page 450 / 973 » The Complexity of Graph Connectivity |
214
click to vote
FOCS
2002
IEEE
15 years 12 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)....
196
click to vote
GD
1995
Springer
15 years 10 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
176
click to vote
GD
1995
Springer
15 years 10 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
213
click to vote
CIIA
2009
15 years 8 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
212
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...