Avraham A. Melkman, Solomon Eyal Shimony. Algorithms for Parsimonious Complete Sets in Directed Graphs. Inf. Process. Lett., 59(6):335-339, 1996. [doi]
@article{MelkmanS96,
title = {Algorithms for Parsimonious Complete Sets in Directed Graphs},
author = {Avraham A. Melkman and Solomon Eyal Shimony},
year = {1996},
doi = {10.1016/0020-0190(96)00123-8},
url = {http://dx.doi.org/10.1016/0020-0190(96)00123-8},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/MelkmanS96},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {59},
number = {6},
pages = {335-339},
}