365 search results - page 44 / 73 » On the combinatorics of Galois numbers |
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
COCOON
1997
Springer
15 years 4 months ago
1997
Springer
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
We consider the problem of simplifying a triangle mesh using edge contractions, under the restriction that the resulting vertices must be a subset of the input set. That is, contr...
COCOON
2006
Springer
15 years 3 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...
CPM
2005
Springer
15 years 1 months ago
2005
Springer
We present efficient sensitivity-analysis algorithms for two problems involving Markov models of sequence evolution: ancestral reconstruction in evolutionary trees and local ungap...