Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683)

From MaRDI portal
Revision as of 04:58, 28 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
  • Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis

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
0 references
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

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references