Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375)
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: Parallel connectivity in edge-colored complete graphs: complexity results |
scientific article; zbMATH DE number 7805290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel connectivity in edge-colored complete graphs: complexity results |
scientific article; zbMATH DE number 7805290 |
Statements
Parallel connectivity in edge-colored complete graphs: complexity results (English)
0 references
15 February 2024
0 references
edge-colored complete graphs
0 references
parallel connectivity
0 references
approximation
0 references
Eulerian subgraphs
0 references
0 references
0.8179484009742737
0 references
0.8176364302635193
0 references
0.8104388117790222
0 references
0.7986796498298645
0 references
