Finding and Updating Depth-First Spanning Trees of Acyclic Digraphs in Parallel

P. Chaudhuri. Finding and Updating Depth-First Spanning Trees of Acyclic Digraphs in Parallel. Comput. J., 33(3):247-251, 1990.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.