Amanote Research

Amanote Research

    RegisterSign In

A Tree-Based Kernel for Graphs

doi 10.1137/1.9781611972825.84
Full Text
Open PDF
Abstract

Available in full text

Date

April 26, 2012

Authors
Giovanni Da San MartinoNicolò NavarinAlessandro Sperduti
Publisher

Society for Industrial and Applied Mathematics


Related search

A Fast Kernel for Attributed Graphs

2016English

Constructing Topic Person Interaction Networks Using a Tree Kernel-Based Method

International Journal of Languages, Literature and Linguistics
2015English

Tree Kernel-Based SVM With Structured Syntactic Knowledge for BTG-based Phrase Reordering

2009English

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Efficient Steiner Tree Construction Based on Spanning Graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
2004English

Normal Tree Orders for Infinite Graphs

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1994English

Performance of a Cavity-Method-Based Algorithm for the Prize-Collecting Steiner Tree Problem on Graphs

Physical Review E
2012English

Fast Generation of Sparse Random Kernel Graphs

PLoS ONE
Multidisciplinary
2015English

Tree Decompositions and Social Graphs

Internet Mathematics
Computational MathematicsApplied MathematicsSimulationModeling
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy