Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

info@nobleid.org

About Fund our work FAQ Developers Terms Policy Persistence & Resolver Service Policy

Graph Kernels: Crossing Information from Different Patterns Using Graph Edit Distance | NobleID

v1

Graph Kernels: Crossing Information from Different Patterns Using Graph Edit Distance

Benoît Gaüzère, Luc Brun, Didier Villemin

BG

Benoît Gaüzère

NobleIDNI3P14W84R49S41

Type:Journal Article

Claim Your Authorship

Sign in to see the full record

Creating an account is free.

Create an account

For data access, contact info@nobleid.org.