"Linear Time Algorithms for Some NP-Complete Problems on (P5, ..."

Hans L. Bodlaender et al. (2003)

> Home

Details and statistics

DOI: 10.1007/978-3-540-45077-1_7

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/BodlaenderBKRS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/BodlaenderBKRS03
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
Linear Time Algorithms for Some NP-Complete Problems on (P₅, Gem)-Free Graphs. FCT 2003: 61-72

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.