Bounded degree graph inference from walks

DOI10.1016/S0022-0000(05)80089-3zbMath0821.68098MaRDI QIDQ1333403

Vijay Raghavan

Publication date: 15 September 1994

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

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)

Related Items (3)

Inferring a tree from walks ⋮ Inferring a graph from path frequency ⋮ Linear-time online algorithm for inferring the shortest path graph from a walk label

Cites Work

• Confluent and Other Types of Thue Systems
• Fast Pattern Matching in Strings
• Complexity of automaton identification from given data
• Unnamed Item
• Unnamed Item

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