Inferring a graph from path frequency

DOI10.1016/j.dam.2012.02.002zbMath1243.05171OpenAlexW2070643689MaRDI QIDQ427879

Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane

Publication date: 18 June 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.02.002

zbMATH Keywords

kernel methodgraph algorithmsfeature vectorpre-image

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• On an algorithm of Zemlyachenko for subtree isomorphism
• On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees.
• A detachment algorithm for inferring a graph from path frequency
• Bounded degree graph inference from walks
• Inferring a tree from walks
• Support-vector networks
• Learning Theory and Kernel Machines
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inferring a graph from path frequency