Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Maximum disjoint paths on edge-colored graphs: approximability and tractability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding disjoint paths on edge-colored graphs: more tractability results / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5403027 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks / rank | |||
Normal rank |
Revision as of 14:16, 17 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
0 references