External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

Bruno Courcelle, Johann A. Makowsky, Udi Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics, 108(1-2):23-52, 2001.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on