A new perspective on FO model checking of dense graph classes

DOI10.1145/2933575.2935314MaRDI QIDQ6829574zbMATH OpenFDO

Authors Jakub Gajarský, Petr Hliněný, Jan Obdržálek, Daniel Lokshtanov, M. S. Ramanujan

Publication date 23 April 2018

Published in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

zbMATH Keywords

model checkingparameterized complexitysparse graph classesFO logiclogic interpretations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

This page was built for publication: A new perspective on FO model checking of dense graph classes

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