An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
Brigitte Jaumard, Michel MinouxVolume:
22
Year:
1986
Language:
english
Pages:
7
DOI:
10.1016/0020-0190(86)90021-9
File:
PDF, 516 KB
english, 1986