Approximation Algorithms for Some Graph Partitioning Problems (Q4511245)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation Algorithms for Some Graph Partitioning Problems |
scientific article; zbMATH DE number 1522949
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms for Some Graph Partitioning Problems |
scientific article; zbMATH DE number 1522949 |
Statements
Approximation Algorithms for Some Graph Partitioning Problems (English)
0 references
14 December 2000
0 references
experimental testing
0 references
graph partitioning
0 references
cliques
0 references
approximation algorithms
0 references
matching algorithms
0 references
0.8204185962677002
0 references
0.8073886036872864
0 references
0.8046714663505554
0 references
0.8043839335441589
0 references
