Algorithms for parsimonious complete sets in directed graphs
| Image |  |
|---|---|
| Description | article by Avraham A. Melkman & Eyal Shlomo (Solomon) Shimony published September 1996 in Information Processing Letters |
| Author/s | |
| Publication date | September 1996 |
| Language | |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |