Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683): Difference between revisions
From MaRDI portal
Revision as of 08:31, 13 July 2024
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
