Sciweavers

730 search results - page 3 / 146
» Combinatorics of Monotone Computations
Sort
View
DCG
1999
74views more  DCG 1999»
13 years 7 months ago
Piles of Cubes, Monotone Path Polytopes, and Hyperplane Arrangements
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...
Christos A. Athanasiadis
CPM
2006
Springer
111views Combinatorics» more  CPM 2006»
13 years 11 months ago
Faster Algorithms for Computing Longest Common Increasing Subsequences
Gerth Stølting Brodal, Kanela Kaligosi, Iri...
CPM
2008
Springer
129views Combinatorics» more  CPM 2008»
13 years 9 months ago
Fast Algorithms for Computing Tree LCS
Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-U...
COMBINATORICS
2004
97views more  COMBINATORICS 2004»
13 years 7 months ago
Dominance Order and Graphical Partitions
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to ...
Axel Kohnert
COMBINATORICS
1999
75views more  COMBINATORICS 1999»
13 years 7 months ago
Stability of Kronecker Products of Irreducible Characters of the Symmetric Group
F. Murnaghan observed a long time ago that the computation of the decompositon of the Kronecker product (n-a,2,... ) (n-b,
Ernesto Vallejo