520 search results - page 86 / 104 » Reductions Between Expansion Problems |
COMPGEOM
2001
ACM
14 years 12 days ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
ECCC
2007
13 years 8 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
CORR
2011
Springer
13 years 15 days ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
ECCC
2007
13 years 8 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
ICSE
2008
IEEE-ACM
14 years 9 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...