"Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width ..."

David Coudert, Guillaume Ducoffe, Alexandru Popa (2019)

> Home

Details and statistics

DOI: 10.1145/3310228

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/CoudertDP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/CoudertDP19
David Coudert, Guillaume Ducoffe, Alexandru Popa:
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. ACM Trans. Algorithms 15(3): 33:1-33:57 (2019)

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.