72 search results - page 13 / 15 » combinatorics 1999 |
DCG
1999
13 years 5 months ago
1999
Monotone path polytopes arise as a special case of the construction of fiber polytopes, introduced by Billera and Sturmfels. A simple example is provided by the permutahedron, whic...
COCOON
2001
Springer
13 years 10 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
COMBINATORICS
1999
13 years 5 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
DM
1999
13 years 5 months ago
1999
Mosaics are orbits of partitions arising from music theoretical investigations. Various theorems from the field of "enumeration under finite group actions" are applied f...
CPM
1999
Springer
13 years 10 months ago
1999
Springer
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...