Bounded degree graph inference from walks

DOI10.1016/S0022-0000(05)80089-3zbMATH Open0821.68098MaRDI QIDQ1333403FDOQ1333403

Authors: Vijay Raghavan 

Publication date: 15 September 1994

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Recommendations

• Graph inference from a walk for trees of bounded degree 3 is NP-complete
• Inferring a tree from walks
• Inferring a tree from walks
• Combinatorial Pattern Matching
• Inferring a graph from path frequency

zbMATH Keywords

edge-colored graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Pattern Matching in Strings
• Complexity of automaton identification from given data
• Confluent and Other Types of Thue Systems

Cited In (8)

• A Detachment Algorithm for Inferring a Graph from Path Frequency
• Graph inference from a walk for trees of bounded degree 3 is NP-complete
• Inferring a graph from path frequency
• Inferring a tree from walks
• Graph odometry
• Title not available (Why is that?)
• Combinatorial Pattern Matching
• Inferring a tree from walks

This page was built for publication: Bounded degree graph inference from walks

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