Sciweavers

1346 search results - page 32 / 270
» On the number of rectangular partitions
Sort
View
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 23 days ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
ICPP
1995
IEEE
13 years 11 months 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
12 years 11 months 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 7 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 7 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