Sciweavers

1248 search results - page 24 / 250
» On the Number of Birch Partitions
Sort
View
ICPP
1995
IEEE
14 years 5 days ago
Multilevel Graph Partitioning Schemes
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
George Karypis, Vipin Kumar
GC
2011
Springer
13 years 3 days ago
Minimum Clique Partition in Unit Disk Graphs
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
Adrian Dumitrescu, János Pach
JDA
2006
83views more  JDA 2006»
13 years 8 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
JCT
2008
59views more  JCT 2008»
13 years 8 months ago
Partition identities and the coin exchange problem
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negati...
Alexander E. Holroyd
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
13 years 8 months ago
A Bijection Between Classes of Fully Packed Loops and Plane Partitions
It has recently been observed empirically that the number of FPL configurations with 3 sets of a, b and c nested arches equals the number of plane partitions in a box of size a
P. Di Francesco, Paul Zinn-Justin, Jean-Bernard Zu...