1127 search results - page 85 / 226 » Testing the Expansion of a Graph |
JAIR
1998
14 years 9 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
GD
2004
Springer
15 years 3 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
LATA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
106
click to vote
SIBGRAPI
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we present a novel method for estimating the effective number of independent variables in imaging applications that require multiple hypothesis testing. The method ...
EVOW
2004
Springer
15 years 3 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...