194 search results - page 7 / 39 » The Polytope of Degree Partitions |
106
click to vote
COMBINATORICS
2006
14 years 12 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
JCAM
2010
14 years 6 months ago
2010
In this paper, (d + 1)-pencil lattices on simplicial partitions in Rd are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition,...
ISSAC
2009
Springer
15 years 6 months ago
2009
Springer
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [7, 14, 16]. We generalize these constructions to mixed systems, whose Ne...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
AICCSA
2007
IEEE
15 years 3 months ago
2007
IEEE
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In noncontiguous allocation, a ...