Graph Minors 1: A Short Proof of the Path-width Theorem.
Reinhard DiestelPublished in: Comb. Probab. Comput. (1995)
Keyphrases
- interactive theorem proving
- hamiltonian path
- solution path
- random walk
- structured data
- directed graph
- graph structure
- graph representation
- graph model
- shortest path problem
- shortest path
- theorem prover
- path length
- graph theoretic
- bi directional
- theorem proving
- graph construction
- dependency graph
- neural network
- weighted graph
- graph matching
- graph partitioning
- stable set
- von neumann
- graph search
- edge weights
- graph mining
- graph theory
- connected components
- pairwise