arXiv (All)
open access
CMSO-transductions for tree-like graph decompositions
We give $\operatorname{CMSO}$-transductions that, given a graph $G$, output 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 $\operatornam
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Automated Inference of Graph Transformation Rules#622689
- Induced subgraphs and tree decompositions XIX. Thetas and forests#927134
- Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma#609718
- GRBench: A Comprehensive Benchmark Evaluation for Graph-relational Data Management#622635
- Induced packing treewidth II. Excluding a clique or a biclique#1036011
Record · ID 1156169
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive