A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099)
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: A linear-time algorithm for finding an edge-partition with max-min ratio at most two |
scientific article; zbMATH DE number 6157656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm for finding an edge-partition with max-min ratio at most two |
scientific article; zbMATH DE number 6157656 |
Statements
A linear-time algorithm for finding an edge-partition with max-min ratio at most two (English)
0 references
25 April 2013
0 references
partition
0 references
graph partition
0 references
optimization problem
0 references
edge weight
0 references
egde-weighted connected simple graph
0 references
edge-disjoint connected components
0 references
max-min ratio
0 references
0 references
0.807813823223114
0 references
0.7932085990905762
0 references
0.7848153710365295
0 references
0.7775657176971436
0 references
0.7759412527084351
0 references
