Analysis of Graphs by Ordering of Nodes

DOI10.1145/321679.321683MaRDI QIDQ5639355zbMATH OpenOpenAlexFDO

Authors

Publication date 1972

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321679.321683

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(6)

• Profitability computations on program flow graphs
• Some properties of fully reducible graphs
• Analysis of program structure
• The linearization of flow charts
• Applications of graph theory in computer systems
• An algorithm for tracing live variables based on a straightened program graph

This page was built for publication: Analysis of Graphs by Ordering of Nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5639355)