Topological ordering of a list of randomly-numbered elements of a network

Authors:
Daniel J. Lasser
Affiliations:
Lockhead Aircraft Corp., Sunnyvale, CA
Venue:
Communications of the ACM
Year:
1961

Citing 0
Cited 6

Computer construction of project networks

Communications of the ACM
The organization of structured files

Communications of the ACM
Skeletal structure of PERT and CPA computer programs

Communications of the ACM
Topological sorting of large networks

Communications of the ACM
A parts breakdown technique using list structures

Communications of the ACM
Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics

Quantified Score

Hi-index	48.30

Visualization

Abstract

A network of directed line segments free of circular elements is assumed. The lines are identified by their terminal nodes and the nodes are assumed to be numbered by a non-topological system. Given a list of these lines in numeric order, a simple technique can be used to create at high speed a list in topological order.