Shortest node-disjoint paths on random graphs.
Caterina De BaccoSilvio FranzDavid SaadChi Ho YeungPublished in: CoRR (2014)
Keyphrases
- disjoint paths
- random graphs
- undirected graph
- directed graph
- approximation algorithms
- graph structure
- learning curves
- spanning tree
- connected components
- complex networks
- minimum cost
- directed acyclic graph
- graph theoretic
- shortest path
- phase transition
- attributed graphs
- binary images
- image processing
- path length
- random walk
- np hard