Answers are grounded in this paper and cite their sources.
A method of analyzing directed graphs by establishing a particular ordering for the nodes is presented, and properties of the ordered graph are derived. Both the method and the resultant order are interesting graph-t heoretically, and also practically: the method is quite efficient, and the results of the analysis are particularly useful to an object code optimizer for programs. The paper includes examples of interesting graphs, and a conjecture about a refinement of the method.
No takes yet. Share an insight, caveat, or question.
Earnest et al. (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: