Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683)
From MaRDI portal
(Redirected from Item:Q2958308)
| 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: Finding disjoint paths on edge-colored graphs: more tractability results |
scientific article; zbMATH DE number 6679759
- Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding disjoint paths on edge-colored graphs: more tractability results |
scientific article; zbMATH DE number 6679759 |
|
Statements
Finding disjoint paths on edge-colored graphs: more tractability results (English)
0 references
Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis (English)
0 references
6 December 2018
0 references
1 February 2017
0 references
parameterized complexity
0 references
approximation
0 references
social networks
0 references
edge-colored graphs
0 references
0 references
0.9614206552505492
0 references
0.8947649002075195
0 references
0.8362477421760559
0 references
0.7610621452331543
0 references