DocumentCode :
1409961
Title :
An Efficient Algorithm for Constructing Hierarchical Graphs
Author :
Yelowitz, Lawrence
Author_Institution :
Computer Science Department, University of Pittsburgh, Pittsburgh, PA 15260.
Issue :
4
fYear :
1976
fDate :
4/1/1976 12:00:00 AM
Firstpage :
327
Lastpage :
329
Abstract :
An algorithm to delete redundant edges from a precedence graph is presented and proved correct. The algorithm is much more efficient than previous algorithms to perform the same task.
Keywords :
Buildings; Computer languages; Computer science; Flowcharts; Tellurium;
fLanguage :
English
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9472
Type :
jour
DOI :
10.1109/TSMC.1976.5408785
Filename :
5408785
Link To Document :
بازگشت