𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithm for graph-partitioning problem using a problem transformation method

✍ Scribed by C.-H. Lee; C.-I. Park; M. Kim

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
717 KB
Volume
21
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithms for the minimum partitioning
Algorithms for the minimum partitioning problems in graphs
✍ Hiroshi Nagamochi πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen

Approximation Algorithms for Maximizatio
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
✍ Uriel Feige; Michael Langberg πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 261 KB

Given a graph G = V E , a weight function w E β†’ R + , and a parameter k, we consider the problem of finding a subset U βŠ† V of size k that maximizes: Max-Vertex Cover k the weight of edges incident with vertices in U, Max-Dense Subgraph k the weight of edges in the subgraph induced by U, Max-Cut k th