Recommendations
Cites work
- A detachment algorithm for inferring a graph from path frequency
- Bounded degree graph inference from walks
- Combinatorial Pattern Matching
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1952951 (Why is no real title available?)
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- scientific article; zbMATH DE number 1872149 (Why is no real title available?)
- Inferring a tree from walks
- On \(O(n \log \log n)\) time algorithm for constructing a graph of maximum connective with prescribed degrees.
- On an algorithm of Zemlyachenko for subtree isomorphism
- On graph kernels: hardness results and efficient alternatives.
- Support-vector networks
Cited in
(6)- A detachment algorithm for inferring a graph from path frequency
- Bounded degree graph inference from walks
- On computational complexity of graph inference from counting
- A Detachment Algorithm for Inferring a Graph from Path Frequency
- Mathematical Foundations of Computer Science 2003
- Combinatorial Pattern Matching
This page was built for publication: Inferring a graph from path frequency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427879)