Definable decompositions for graphs of bounded linear cliquewidth
DOI10.1145/3209108.3209135zbMath1452.03088arXiv1803.05937OpenAlexW2963545495MaRDI QIDQ5145285
Mikołaj Bojańczyk, Martin Grohe, Michał Pilipczuk
Publication date: 20 January 2021
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.05937
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Automata and formal grammars in connection with logical questions (03D05) Higher-order logic (03B16)
This page was built for publication: Definable decompositions for graphs of bounded linear cliquewidth
