Inferring a tree from walks

DOI10.1007/3-540-55808-X_37zbMath1493.68275MaRDI QIDQ5096851

Osamu Maruyama, Satoru Miyano

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• On finding minimal length superstrings
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets

This page was built for publication: Inferring a tree from walks