Bojańczyk, M., & Pilipczuk, M. (2016, July 5). Definability equals recognizability for graphs of bounded treewidth. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 407-416. https://doi.org/10.1145/2933575.2934508
Chicago-Zitierstil (17. Ausg.)Bojańczyk, Mikołaj, und Michał Pilipczuk. "Definability Equals Recognizability for Graphs of Bounded Treewidth." Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science 5 Jul. 2016: 407-416. https://doi.org/10.1145/2933575.2934508.
MLA-Zitierstil (9. Ausg.)Bojańczyk, Mikołaj, und Michał Pilipczuk. "Definability Equals Recognizability for Graphs of Bounded Treewidth." Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 5 Jul. 2016, pp. 407-416, https://doi.org/10.1145/2933575.2934508.