Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7595916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the maximally balanced connected graph tripartition problem |
scientific article; zbMATH DE number 7595916 |
Statements
Approximation algorithms for the maximally balanced connected graph tripartition problem (English)
0 references
4 October 2022
0 references
graph partition
0 references
induced subgraph
0 references
connected component
0 references
2-connected component
0 references
approximation algorithm
0 references
0 references
0.9161269068717957
0 references
0.9115727543830872
0 references
0.8548763990402222
0 references
0.8535878658294678
0 references
0.8399456143379211
0 references
