Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model
In a previous paper we defined the black and white SAT problem which has exactly two solutions, where each variable is either true or false. We showed that black and white 2-SAT problems represent strongly connected directed graphs. We presented also the strong model of communication graphs. In this...
Main Authors: | Gábor Kusper, Csaba Biró |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-12-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/13/12/321 |
Similar Items
-
Resolvable Networks—A Graphical Tool for Representing and Solving SAT
by: Gábor Kusper, et al.
Published: (2021-10-01) -
The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs
by: Dorota Kuziak
Published: (2020-08-01) -
Strong Chromatic Index of Outerplanar Graphs
by: Ying Wang, et al.
Published: (2022-04-01) -
Energy of strong reciprocal graphs
by: Maryam Ghahremani, et al.
Published: (2023-09-01) -
Strong Domination in Fuzzy Graphs
by: O.T. Manjusha, et al.
Published: (2015-09-01)