194 search results - page 30 / 39 » The Polytope of Degree Partitions |
SODA
2007
ACM
15 years 1 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
124
click to vote
DEFORM
2000
15 years 1 months ago
2000
The ball-and-socket joint model is used to represent articulations with three rotational degrees of freedom (DOF), such as the human shoulder and the hip. The goal of this paper i...
DM
2008
14 years 12 months ago
2008
Let be a partition. BG-rank() is defined as an alternating sum of parities of parts of [1]. In [2], Berkovich and Garvan found theta series representations for the t-core generat...
EJC
2008
14 years 12 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
JCT
2008
14 years 11 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...