Analysis of Graphs by Ordering of Nodes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Analysis of Graphs by Ordering of Nodes

Full text

Pdf (1.08 MB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 1 (January 1972) table of contents

Pages: 23 - 42

Year of Publication: 1972

ISSN:0004-5411

Authors

C. P. Earnest	Computer Sciences Corporation, El Segundo, California
K. G. Balke	Burroughs Corporation, City of Industry, California and Computer Sciences Corporation, El Segundo, California
J. Anderson	Computer Sciences Corporation, El Segundo, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 20, Citation Count: 10

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions 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/321679.321683 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, CL=~UDE. The Theory of Graphs and Its Applications. Wiley, New York, 1964.
	2	John Cocke, Programming languages and their compilers: Preliminary notes, Courant Institute of Mathematical Sciences, New York University, 1969
	3	PROSSER, 11. Applications of BooleaH matrices to the anulysis of flow diagrams. Pro~ Eastern Joint Comptd. Conf. 1959 (Spartan Books, Washington, 1).C.),t pp 133-137.
	4	C. V. Ramamoorthy, Analysis of Graphs by Connectivity Considerations, Journal of the ACM (JACM), v.13 n.2, p.211-222, April 1966 [doi>10.1145/321328.321332]

CITED BY 10

	Christopher Earnest, Some Topics in Code Optimization, Journal of the ACM (JACM), v.21 n.1, p.76-102, Jan. 1974
	John R. Brown , Kurt F. Fischer, A graph theoretic approach to the verification of program structures, Proceedings of the 3rd international conference on Software engineering, p.136-141, May 10-12, 1978, Atlanta, Georgia, United States
	John Cocke , Ken Kennedy, An algorithm for reduction of operator strength, Communications of the ACM, v.20 n.11, p.850-856, Nov. 1977
	Matthew S. Hecht , Jeffrey D. Ullman, Analysis of a simple algorithm global data flow problems, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.207-217, October 01-03, 1973, Boston, Massachusetts
	David B. Loveman , Ross A. Faneuf, Program optimization - theory and practice, ACM SIGPLAN Notices, v.10 n.3, p.97-102, March 1975
	Portia Isaacson, PS language definition, ACM SIGDA Newsletter, v.4 n.3, p.20-28, September 1974
	Ken Kennedy , Linda Zucconi, Applications of a graph grammar for program control flow analysis, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.72-85, January 17-19, 1977, Los Angeles, California
	Gary A. Kildall, A unified approach to global program optimization, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.194-206, October 01-03, 1973, Boston, Massachusetts
	Portia Isaacson, Picture systems, PS, and the design of a channel-to-channel computer interface, ACM SIGARCH Computer Architecture News, v.3 n.4, p.63-70, December 1974
	Robert R. Korfhage, On the development of data structures, ACM SIGPLAN Notices, v.9 n.12, p.14-23, December 1974