"On the restriction of some NP-complete graph problems to permutation graphs."

Andreas Brandstädt, Dieter Kratsch (1985)

> Home

Details and statistics

DOI: 10.1007/BFB0028791

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fct/BrandstadtK85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/BrandstadtK85
Andreas Brandstädt, Dieter Kratsch:
On the restriction of some NP-complete graph problems to permutation graphs. FCT 1985: 53-62

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.