MSO transduction recovers the laminar tree from a laminar set system, resolving Courcelle's question and enabling MSO constructions for modular, split, and bi-join decompositions.
Cmso-transducing tree-like graph decompositions
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
CMSO-transductions are given for the modular, split and bi-join decompositions of graphs, plus a generalization to weakly-partitive set systems.
citing papers explorer
-
The role of counting quantifiers in laminar set systems
MSO transduction recovers the laminar tree from a laminar set system, resolving Courcelle's question and enabling MSO constructions for modular, split, and bi-join decompositions.
-
CMSO-transducing tree-like graph decompositions
CMSO-transductions are given for the modular, split and bi-join decompositions of graphs, plus a generalization to weakly-partitive set systems.