Computing Vertex-Disjoint Paths in Large Graphs Using MAOs.
Johanna E. PreißerJens M. SchmidtPublished in: ISAAC (2018)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- spanning tree
- approximation algorithms
- directed acyclic graph
- graph structure
- vertex set
- random graphs
- average degree
- random walk
- complex networks
- connected components
- labeled graphs
- minimum cost
- connected subgraphs
- graph theoretic
- attributed graphs
- graph model
- graph matching
- graph representation
- hamiltonian cycle
- probability distribution
- query processing
- pattern recognition