Equipartitions of Graphs (1991)
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {David Eppstein and Joan Feigenbaum and Chung-Lun Li},
title = {Equipartitions of Graphs},
journal = {B C E D (a) Connectivity graph},
year = {1991}
}
Bookmarks
OpenURL
Abstract:
Let G be an undirected graph on n nodes, and let k be an integer that divides n.Ak-equipartition # of G is a partition of V (G)into k equal-sized pieces V 1 , ..., V k . A pair V i , V j of distinct sets in # is called a bad pair if there is at least one edge v i -- v j of E(G) such that v i # V i and v j # V j . The parameterized equipartition problem is: given G and k, find an optimal k-equipartition of G, i.e., one with the smallest possible number of bad pairs. More generally, a nontrivial equipartition of G is a k-equipartition, for some proper divisor k of n. The equipartition problem is: given G, find a nontrivial equipartition with the minimum number of bad pairs, where the minimum is taken over all divisors k of n and all k-equipartitions. We prove that there are relatively sparse graphs all of whose equipartitions have the maximum number of bad pairs (up to constant factors). We also prove that the parameterized and unparameterized versions of the equipartition proble...
Citations
| 7271 | Computers and Intractability - A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 28 | An Introduction to the Theory of – NIVEN, ZUCKERMAN, et al. - 1991 |
| 23 | Embedding planar graphs in four pages – Yannakakis - 1986 |
| 8 | Optimal Sequential Partitions of Graphs – Kernighan - 1971 |
| 3 | On Factorable Extensions and Subgraphs of Prime Graphs – FEIGENBAUM, HADDAD - 1989 |
| 2 | Timing Trigger and Control reference WEB site http://www.cern.ch/TTC/intro.html – unknown authors - 1986 |
| 1 | Separator Theorems with Applications – Chung |
| 1 | Lexicographically Factorable Extensions of Irreducible Graphs, to appear – Feigenbaum - 1988 |
