Partitioning graphs into connected parts (Q1034603)
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: Partitioning graphs into connected parts |
scientific article; zbMATH DE number 5626954
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning graphs into connected parts |
scientific article; zbMATH DE number 5626954 |
Statements
Partitioning graphs into connected parts (English)
0 references
6 November 2009
0 references
graph partition
0 references
edge contraction
0 references
path
0 references
exact algorithm
0 references
0.998693585395813
0 references
0.8566424250602722
0 references
0.852982223033905
0 references
0.8074532747268677
0 references
0.8017289042472839
0 references
