A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs.
Christian DoczkalGuillaume CombetteDamien PousPublished in: ITP (2018)
Keyphrases
- formal proof
- bounded treewidth
- upper bound
- np complete
- theorem prover
- graph structure
- search space
- graph matching
- constraint graph
- graph theoretic
- graph properties
- boolean functions
- graph mining
- spanning tree
- computational complexity
- graph representation
- directed graph
- search algorithm
- undirected graph
- graph construction
- space complexity
- graph model