Graph minors. IX. Disjoint crossed paths.
Neil RobertsonPaul D. SeymourPublished in: J. Comb. Theory, Ser. B (1990)
Keyphrases
- pairwise
- directed graph
- graph theoretic
- graph search
- random walk
- structured data
- connected components
- graph structure
- graph representation
- graph mining
- path length
- bipartite graph
- graph matching
- graph clustering
- dependency graph
- graph properties
- real time
- directed acyclic graph
- markov chain
- database
- graph model
- path finding
- shortest path
- information systems
- disjoint paths