Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes

The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes. First-order interpretations and transductions of...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Author:	Dreier, Jan
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Computational modeling Computer science
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!