An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

Full text

Pdf (365 KB)

Source

Journal of the ACM (JACM) archive
Volume 16 , Issue 3 (July 1969) table of contents

Pages: 455 - 460

Year of Publication: 1969

ISSN:0004-5411

Authors

Dennis M. Moyles	Carnegie-Mellon University, Pittsburgh, Pennsylvania
Gerald L. Thompson	Carnegie-Mellon University, Pittsburgh, Pennsylvania

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 63, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321526.321534 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BERGE, C. Theorie des grapes et ses application Dunod, Paris, 1958. (English trans. Wiley, New York, 1962.)
	2	Robert W. Floyd, Algorithm 96: Ancestor, Communications of the ACM, v.5 n.6, p.344-345, June 1962 [doi>10.1145/367766.368166]
	3	HARARY, F., NORMAN, R. Z., AND CARTWPIGHT, D. Structural Models: An Introduction to the Theory of Directed Graphs. Wiley, New York, 1965.
	4	Stephen Warshall, A Theorem on Boolean Matrices, Journal of the ACM (JACM), v.9 n.1, p.11-12, Jan. 1962 [doi>10.1145/321105.321107]

CITED BY 6

	Harry T. Hsu, An Algorithm for Finding a Minimal Equivalent Graph of a Digraph, Journal of the ACM (JACM), v.22 n.1, p.11-16, Jan. 1975
	Adrian Vetta, Approximating the minimum strongly connected subgraph via a matching lower bound, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.417-426, January 07-09, 2001, Washington, D.C., United States
	Carolyn McCreary, Parsing a graph-grammar, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.249-255, February 1988, Atlanta, Georgia, United States
	Hiralal Agrawal, Dominators, super blocks, and program coverage, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.25-34, January 16-19, 1994, Portland, Oregon, United States
	Samir Khuller , Balaji Raghavachari , Neal E. Young, Approximating the minimum equivalent digraph, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.177-186, January 23-25, 1994, Arlington, Virginia, United States
	Hira Agrawal, Efficient coverage testing using global dominator graphs, ACM SIGSOFT Software Engineering Notes, v.24 n.5, p.11-20, Sept. 1999