128 search results - page 1 / 26 » Partitioning a weighted partial order |
100
Voted
JCO
2008
14 years 10 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
80
Voted
COMBINATORICS
2004
14 years 10 months ago
2004
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 ...
JDA
2008
14 years 10 months ago
2008
100
Voted
WG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
89
Voted
SIAMSC
2010
14 years 5 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...