C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Essentially Tight Kernels for (Weakly) Closed Graphs.
Tomohiro Koana
Christian Komusiewicz
Frank Sommer
Published in:
Algorithmica (2023)
Keyphrases
</>
graph kernels
upper bound
lower bound
worst case
graph matching
linear combination
kernel function
graph theory
graph theoretic
support vector
directed graph
complex structures
multiple kernel learning
series parallel