Finding disjoint paths on edge-colored graphs: more tractability results.
Riccardo DondiFlorian SikoraPublished in: J. Comb. Optim. (2018)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- graph structure
- spanning tree
- strongly connected
- directed acyclic graph
- connected components
- graph matching
- graph theory
- random graphs
- minimum cost
- weighted graph
- graph structures
- graph partitioning
- graph databases
- clustering algorithm
- complex networks
- random walk
- upper bound