๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A class of bounded approximation algorithms for graph partitioning

โœ Scribed by Thomas A. Feo; Mallek Khellaf

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
847 KB
Volume
20
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A class of dynamic rough partitive algor
A class of dynamic rough partitive algorithms
โœ Georg Peters; Richard Weber ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 153 KB

Partitive algorithms, like cluster algorithms, are frequently used methods in data mining. Most of them are static in the sense that they detect pattern in stable data structures, i.e. the data structure remains unchanged over time. However, many real-life situations are characterized by changing da

Orderly algorithms for generating restri
Orderly algorithms for generating restricted classes of graphs
โœ Charles J. Colbourn; Ronald C. Read ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 463 KB

## Abstract Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of