"Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT ..."

Gábor Kusper, Csaba Biró (2020)

> Home

Details and statistics

DOI: 10.3390/A13120321

access: open

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithms/KusperB20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithms/KusperB20
Gábor Kusper, Csaba Biró:
Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model. Algorithms 13(12): 321 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.