TY  - JOUR

T1  - Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism

JO  - ACM Transactions on Computational Logic

UR  - http://dx.doi.org/10.1145/3303881

PY  - 2019/03/29

AU  - Verbitsky O

AU  - Zhukovskii M

ED  - 

DO  - DOI: 10.1145/3303881

PB  - Association for Computing Machinery (ACM)

VL  - 20

IS  - 2

SP  - 1

EP  - 18

Y2  - 2024/12/23

ER  -