On the maximum disjoint paths problem on edge-colored graphs (Q435732)
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 6055037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum disjoint paths problem on edge-colored graphs |
scientific article; zbMATH DE number 6055037 |
Statements
On the maximum disjoint paths problem on edge-colored graphs (English)
0 references
12 July 2012
0 references
algorithm
0 references
approximation algorithm
0 references
colored-graph
0 references
disjoint paths
0 references
social network analysis
0 references
connectivity
0 references
0.8936114311218262
0 references
0.8308802843093872
0 references
0.823972761631012
0 references
