Definability equals recognizability for graphs of bounded treewidth

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Mikołaj Bojańczyk, Michał Pilipczuk

Journal title: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16

Journal publisher: ACM Press

Published year: 2016

Published pages: 407-416

DOI identifier: 10.1145/2933575.2934508

ISBN: 9781-450343916