Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability.
Paola BonizzoniRiccardo DondiYuri PirolaPublished in: Algorithms (2013)
Keyphrases
- disjoint paths
- approximation algorithms
- undirected graph
- directed graph
- np hard
- minimum cost
- special case
- random graphs
- worst case
- np complete
- spanning tree
- constraint satisfaction
- directed acyclic graph
- connected components
- graph structures
- random walk
- graph matching
- complex networks
- graph mining
- weighted graph
- graph theoretic
- strongly connected
- graph model
- graph databases
- graph structure
- approximation guarantees
- computational complexity