"A Satisfiability Formulation of Problems on Level Graphs."

Bert Randerath et al. (2001)

> Home

Details and statistics

DOI: 10.1016/S1571-0653(04)00327-0

access: closed

type: Journal Article

metadata version: 2020-02-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/endm/RanderathSBHKMSC01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/RanderathSBHKMSC01
Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek:
A Satisfiability Formulation of Problems on Level Graphs. Electron. Notes Discret. Math. 9: 269-277 (2001)

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.