On the distribution of the transitive closure in a random acyclic digraph
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 345-356
- https://doi.org/10.1007/3-540-57273-2_69
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Graph AlgorithmsPublished by Elsevier ,1990
- An improved algorithm for transitive closure on acyclic digraphsTheoretical Computer Science, 1988
- An identity for the divisor generating function arising from sorting theoryJournal of Combinatorial Theory, Series A, 1981
- A reduct-and-closure algorithm for graphsLecture Notes in Computer Science, 1979