Monadic Second Order Logic on Graphs with Local Cardinality Constraints

Authors:
Stefan Szeider
Affiliations:
Department of Computer Science, Durham University, UK
Venue:
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Year:
2008

Citing 10
Cited 3

General factors of graphs

Journal of Combinatorial Theory Series B
Easy problems for tree-decomposable graphs

Journal of Algorithms
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
On Equitable Coloring of d-Degenerate Graphs

SIAM Journal on Discrete Mathematics
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Equitable colorings of bounded treewidth graphs

Theoretical Computer Science - Graph colorings
Tractable cases of the extended global cardinality constraint

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77

Belief Revision with Bounded Treewidth

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Counting and enumeration problems with bounded treewidth

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that all problems of the following form can be solved in polynomial time for graphs of bounded treewidth: Given a graph Gand for each vertex vof Ga set 茂戮驴(v) of non-negative integers. Is there a set Sof vertices or edges of Gsuch that Ssatisfies a fixed property expressible in monadic second order logic, and for each vertex vof Gthe number of vertices/edges in Sadjacent/incident with vbelongs to the set 茂戮驴(v)? A wide range of problems can be formulated in this way, for example Lovász's General Factor Problem.