1127 search results - page 6 / 226 » Testing the Expansion of a Graph |
ICCV
2005
IEEE
14 years 11 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
ESA
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we show that for an n-vertex graph G of genus g, the edge expansion of G can be determined in time nO(g2 ) . We show that the same is true for various other similar ...
EJC
2008
13 years 10 months ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
VLDB
2005
ACM
14 years 3 months ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
