Search Results for author:
Found 3 papers, 1 papers with code
On Valid Optimal Assignment Kernels and Applications to Graph Classification
The success of kernel methods has initiated the design of novel positive semidefinite functions, in particular for structured data.
Ranked #2 on
Graph Classification
on NCI109
A general purpose algorithm for counting simple cycles and simple paths of any length
These comparisons show that the algorithm described here is the best general purpose algorithm for the class of graphs where $(\ell^{\omega-1}\Delta^{-1}+1) |S_\ell|\leq |\text{Cycle}_\ell|$, with $|\text{Cycle}_\ell|$ the total number of simple cycles of length at most $\ell$, including backtracks and self-loops.
Data Structures and Algorithms Discrete Mathematics Combinatorics 68Q25, 68W40, 05C30, 05C38, 05C22
Computing Optimal Assignments in Linear Time for Approximate Graph Matching
In this paper, we develop an algorithm which can find an optimal assignment in linear time when the cost function between objects is represented by a tree distance.
