Bounded Degree Graph Inference from Walks
Abstract
Aslam and Rivest considered the problem of inferring the smallest edge-colored graph of degree bound k consistent with the sequence of colors seen in a walk of the graph. Using Church-Rosser properties of certain sets of rewrite rules, they gave a polynomial time algorithm for the case of k = 2. The straightforward implementation of their ideas results in an O(n 5) algorithm, where n is the length of the walk. In this paper, we develop their ideas further and give an O(n log n) algorithm for the same problem. We also show that if the degree bound k is greater than two, then the decision version of the problem is NP-complete, thus settling a conjecture of Aslam and Rivest.
Cite
Text
Raghavan. "Bounded Degree Graph Inference from Walks." Annual Conference on Computational Learning Theory, 1991. doi:10.1016/S0022-0000(05)80089-3Markdown
[Raghavan. "Bounded Degree Graph Inference from Walks." Annual Conference on Computational Learning Theory, 1991.](https://mlanthology.org/colt/1991/raghavan1991colt-bounded/) doi:10.1016/S0022-0000(05)80089-3BibTeX
@inproceedings{raghavan1991colt-bounded,
title = {{Bounded Degree Graph Inference from Walks}},
author = {Raghavan, Vijay},
booktitle = {Annual Conference on Computational Learning Theory},
year = {1991},
pages = {354-366},
doi = {10.1016/S0022-0000(05)80089-3},
url = {https://mlanthology.org/colt/1991/raghavan1991colt-bounded/}
}