"The graph sandwich problem for 1-join composition is NP-complete."

Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic (2000)

> Home

Details and statistics

DOI: 10.1016/S1571-0653(05)80133-7

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/FigueiredoKV00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/FigueiredoKV00
Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic:
The graph sandwich problem for 1-join composition is NP-complete. Electron. Notes Discret. Math. 5: 89-92 (2000)

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.