31 search results - page 4 / 7 » On Testing Expansion in Bounded-Degree Graphs |
APPROX
2004
Springer
14 years 26 days ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
ECCC
2007
13 years 7 months ago
2007
STOC
1992
ACM
13 years 11 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
WEBI
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a set of sentences containing target relations. Duri...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...