(2/2/3)-SAT problem and its applications in dominating set problems (Q5207845)
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: (2/2/3)-SAT problem and its applications in dominating set problems |
scientific article; zbMATH DE number 7150556
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | (2/2/3)-SAT problem and its applications in dominating set problems |
scientific article; zbMATH DE number 7150556 |
Statements
13 January 2020
0 references
(2/2/3)-SAT
0 references
computational complexity
0 references
independent dominating set
0 references
perfect codes
0 references
regular graphs
0 references
incidence coloring
0 references
0.7547261714935303
0 references
0.7542281746864319
0 references
0.7499097585678101
0 references
0.7394550442695618
0 references
0.734305739402771
0 references
