A family of efficient kernels for large graphs with discrete node labels based on the Weisfeiler-Lehman test of isomorphism on graphs that outperform state-of-the-art graph kernels on several graph classification benchmark data sets in terms of accuracy and runtime.Expand

There is no standard library of the data structures and algorithms of combinatorial and geometric computing, and there are, for example, packages in statistics (SPSS), numerical analysis (LINPACK), symbolic computation (MAPLE, MATHEMATICA), and linear programming (CPLEX).Expand

In this article, two theoretically grounded speedup schemes are introduced, one based on sampling and the second specifically designed for bounded degree graphs, to efficiently compare large graphs that cannot be tackled by existing graph kernels.Expand

Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the <italic>radix heap</italic>, is proposed for use in this algorithm. On a network… Expand

An overview of the LEDA platform for combinatorial and geometric computing and an account of its development are given and some recent theoretical developments are discussed.Expand

A PRAM algorithm is given based on Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel.Expand

The first polynomial-time algorithms to determine if an instance admits a popular matching, and to find a largest such matching, if one exists are given.Expand

An Omega (log n) lower bound is proved for the amortized worst-case time complexity of any deterministic algorithm in a class of algorithms encompassing realistic hashing-based schemes.Expand