"On the fixed parameter complexity of graph enumeration problems definable ..."

Bruno Courcelle, Johann A. Makowsky, Udi Rotics (2001)

> Home

Details and statistics

DOI: 10.1016/S0166-218X(00)00221-3

access: open

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/CourcelleMR01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/CourcelleMR01
Bruno Courcelle, Johann A. Makowsky, Udi Rotics:
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discret. Appl. Math. 108(1-2): 23-52 (2001)

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.