Sciweavers

1248 search results - page 18 / 250
» On the Number of Birch Partitions
Sort
View
COMBINATORICS
2006
130views more  COMBINATORICS 2006»
13 years 8 months ago
Fractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
Valerie L. Watts
JCT
2002
84views more  JCT 2002»
13 years 8 months ago
Binary Partitions Revisited
The restricted binary partition function bk(n) enumerates the number of ways to represent n as n = 2a0 + 2a1 +
Øystein J. Rødseth, James A. Sellers
DM
2010
83views more  DM 2010»
13 years 8 months ago
Polychromatic colorings of arbitrary rectangular partitions
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...
Dániel Gerbner, Balázs Keszegh, Nath...
ICTAI
2007
IEEE
14 years 2 months ago
Hypergraph Partitioning for Exploiting Localities in Nonlinear Constrained Optimization
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
Benjamin W. Wah, Soomin Lee
JDA
2008
67views more  JDA 2008»
13 years 8 months ago
On minimum k-modal partitions of permutations
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
Gabriele Di Stefano, Stefan Krause, Marco E. L&uum...