Finding Disjoint Paths on Edge-Colored Graphs: A Multivariate Complexity Analysis.
Riccardo DondiFlorian SikoraPublished in: CoRR (2016)
Keyphrases
- disjoint paths
- complexity analysis
- undirected graph
- directed graph
- approximation algorithms
- lower bound
- strongly connected
- theoretical analysis
- computational complexity
- weighted graph
- spanning tree
- connected components
- graph structure
- directed acyclic graph
- first order logic
- random walk
- graph theoretic
- multivariate data
- minimum cost
- upper bound
- graph representation
- probability distribution
- expert systems
- vertex set
- image segmentation