"How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in ..."

Wolfgang Espelage, Frank Gurski, Egon Wanke (2001)

> Home

Details and statistics

DOI: 10.1007/3-540-45477-2_12

access: closed

type: Conference or Workshop Paper

metadata version: 2020-10-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/EspelageGW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/EspelageGW01
Wolfgang Espelage, Frank Gurski, Egon Wanke:
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. WG 2001: 117-128

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.