Graph inference from a walk for trees of bounded degree 3 is NP-complete

DOI10.1007/3-540-60246-1_132MaRDI QIDQ3569017zbMATHOpenAlexFDO

Authors Osamu Maruyama, Satoru Miyano

Publication date 17 June 2010

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

Full work available at URL https://doi.org/10.1007/3-540-60246-1_132

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Inferring a tree from walks
• Bounded degree graph inference from walks
• scientific article; zbMATH DE number 3878376
• Inferring a tree from walks
• Publication:4888093

Cited in

(3)

• Inferring a tree from walks
• Inferring a tree from walks
• scientific article; zbMATH DE number 908771 (Why is no real title available?)

This page was built for publication: Graph inference from a walk for trees of bounded degree 3 is NP-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569017)