Graph-structured data arise ubiquitously in many application domains. A fundamental problem is to quantify their similarities. Graph kernels are often used for this purpose, which decompose graphs into substructures and compare these substructures. However, most of the existing graph do not have property scale-adaptivity, i.e., they cannot at multiple levels granularities. Many real-world such ...