492 search results - page 89 / 99 » combinatorics 2006 |
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
COCOON
2006
Springer
15 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...
COMBINATORICS
2002
14 years 9 months ago
2002
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
COMBINATORICS
1998
14 years 9 months ago
1998
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...