Equivalence of strongly connected graphs and black-and-white 2-SAT problems (Q5379589)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equivalence of strongly connected graphs and black-and-white 2-SAT problems |
scientific article; zbMATH DE number 7065639
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence of strongly connected graphs and black-and-white 2-SAT problems |
scientific article; zbMATH DE number 7065639 |
Statements
Equivalence of strongly connected graphs and black-and-white 2-SAT problems (English)
0 references
12 June 2019
0 references
black-and-white SAT problem
0 references
SAT representation
0 references
communication graph
0 references
connectivity test
0 references
strongly connected graph
0 references
0.8503277
0 references
0.84596413
0 references
0 references
0.8418751
0 references
