Computing Maximum Unavoidable Subgraphs Using SAT Solvers (Q2818013)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Maximum Unavoidable Subgraphs Using SAT Solvers |
scientific article |
Statements
Computing Maximum Unavoidable Subgraphs Using SAT Solvers (English)
0 references
5 September 2016
0 references
satisfiability solving
0 references
unavoidable subgraph
0 references
combinatorics
0 references
graph theory
0 references
symmetry breaking
0 references
