scientific article; zbMATH DE number 7559449

DOI10.4230/LIPICS.MFCS.2020.78MaRDI QIDQ5089253FDOQ5089253

Authors: Adam Paszke, Michał Pilipczuk 

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2003.14177

Title of this publication is not available (Why is that?)

zbMATH Keywords

treewidthcliquewidthdefinable setsvapnik-chervonenkis density

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Upper bounds to the clique width of graphs
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
• Graph minors. V. Excluding a planar graph
• Monadic second-order definable graph transductions: a survey
• Vertex-minors, monadic second-order logic, and a conjecture by Seese
• Fly-automata for checking \(\mathrm{MSO}_2\) graph properties
• The structure of the models of decidable monadic theories of graphs
• From tree-decompositions to clique-width terms
• Logical description of context-free graph languages
• Title not available (Why is that?)
• Learnability and definability in trees and similar structures
• On the number of types in sparse graphs

Cited In (2)

• Neighbourhood complexity of graphs of bounded twin-width
• The VC-dimension of set systems defined by graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089253)