Inferring a tree from walks

DOI10.1016/0304-3975(95)00156-5zbMath0872.68137OpenAlexW2062960999MaRDI QIDQ1351963

Osamu Maruyama, Satoru Miyano

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00156-5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Learning Tree Languages ⋮ Inferring a graph from path frequency ⋮ Linear-time online algorithm for inferring the shortest path graph from a walk label

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finding minimal length superstrings
• Optimization, approximation, and complexity classes
• A note on shortest superstrings with flipping
• Bounded degree graph inference from walks
• Graph inference from a walk for trees of bounded degree 3 is NP-complete
• The minimum consistent DFA problem cannot be approximated within any polynomial
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• Linear approximation of shortest superstrings

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