scientific article; zbMATH DE number 908771

zbMATH Open0852.68073MaRDI QIDQ4888093FDOQ4888093

Authors: Osamu Maruyama, Satoru Miyano 

Publication date: 23 July 1996

Title of this publication is not available (Why is that?)

Recommendations

• Inferring a tree from walks
• Inferring a tree from walks
• Graph inference from a walk for trees of bounded degree 3 is NP-complete
• Bounded degree graph inference from walks
• Acyclicity in edge-colored graphs

zbMATH Keywords

walk realizability problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (2)

• Graph inference from a walk for trees of bounded degree 3 is NP-complete
• Inferring a tree from walks

This page was built for publication:

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