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

B. Courcelle, J.A. Makowsky, U. Rotics

Source record

Source: Crossref

Published: Feb 1, 2001

DOI: 10.1016/s0166-218x(00)00221-3

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.