Max-min partitioning of grid graphs into connected components (Q4540070)
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: Max-min partitioning of grid graphs into connected components |
scientific article; zbMATH DE number 1769314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Max-min partitioning of grid graphs into connected components |
scientific article; zbMATH DE number 1769314 |
Statements
21 July 2002
0 references
partitioning
0 references
rectangular grid graph
0 references
max-min problem
0 references
shifting algorithm
0 references
error estimates
0 references
min-max problem
0 references
Max-min partitioning of grid graphs into connected components (English)
0 references
0.8834630250930786
0 references
0.8834629058837891
0 references
0.860819935798645
0 references
0.8474446535110474
0 references
0.8221730589866638
0 references
