A Detachment Algorithm for Inferring a Graph from Path Frequency

DOI10.1007/11809678_30MaRDI QIDQ3591314zbMATH OpenOpenAlexFDO

Authors Hiroshi Nagamochi

Publication date 10 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11809678_30

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A detachment algorithm for inferring a graph from path frequency
• Inferring a graph from path frequency
• Combinatorial Pattern Matching
• On computational complexity of graph inference from counting
• Bounded degree graph inference from walks

Cited in

(5)

• A detachment algorithm for inferring a graph from path frequency
• Eulerian detachments with local edge-connectivity
• Some Theorems on Detachments Preserving Local-Edge-Connectivity
• Inferring a graph from path frequency
• Combinatorial Pattern Matching

This page was built for publication: A Detachment Algorithm for 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 Q3591314)