๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs

โœ Scribed by Brigitte Jaumard; Michel Minoux


Book ID
113162847
Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
516 KB
Volume
22
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES