CMSO-transducing tree-like graph decompositions - Archive ouverte HAL
Communication Dans Un Congrès Année : 2025

CMSO-transducing tree-like graph decompositions

Résumé

We show that given a graph G we can CMSO-transduce its modular decomposition, its split decomposition and its bi-join decomposition. This improves results by Courcelle [Logical Methods in Computer Science, 2006] who gave such transductions using order-invariant MSO, a strictly more expressive logic than CMSO. Our methods more generally yield C2MSO-transductions of the canonical decomposition of weakly-partitive set systems and weakly-bipartitive systems of bipartitions.

Dates et versions

hal-04859273 , version 1 (30-12-2024)

Identifiants

Citer

Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Noleen Köhler. CMSO-transducing tree-like graph decompositions. STACS 2025, Dec 2024, Jena, Germany. ⟨10.48550/arXiv.2412.04970⟩. ⟨hal-04859273⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More