1136 search results - page 5 / 228 » Finding Small Holes |
COCOON
2006
Springer
14 years 1 months ago
2006
Springer
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
COCOON
2009
Springer
14 years 4 months ago
2009
Springer
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...
IWPEC
2004
Springer
14 years 3 months ago
2004
Springer
ISSAC
1994
Springer
14 years 1 months ago
1994
Springer
