2010 | OriginalPaper | Buchkapitel
The Complexity of Satisfaction on Sparse Graphs
verfasst von : Anuj Dawar
Erschienen in: Parameterized and Exact Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We consider the complexity of deciding, given a graph
G
and a formula
φ
of first-order logic in the language of graphs, whether or not
G
⊧
φ
. In other words, we are interested in the complexity of the satisfaction relation for first-order logic on graphs. More particularly, we look at the complexity of this problem parameterized by the length of the formula
φ
. This problem (which is known to be
AW
[*]-complete) includes as special cases many important graph-theoretic problems, including
Independent Set, Dominating Set
and complete problems at all levels of the
W
-hierarchy.