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.
Branch-width, parse trees, and monadic second-order logic for matroids
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
A unified framework yields eight depth measures on matroids with six shown functionally inequivalent, two matching branch-depth and tree-depth, and all coinciding on matroids versus matrices over any field.
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.
-
Measuring Depth of Matroids
A unified framework yields eight depth measures on matroids with six shown functionally inequivalent, two matching branch-depth and tree-depth, and all coinciding on matroids versus matrices over any field.
-
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.