Topological ordering of a list of randomly-numbered elements of a network
Communications of the ACM · 1961 · 23 citations · 0 references
Directed GraphEngineeringPlanar GraphNetwork AnalysisEducationComputational TopologyScale-free NetworkRandom GraphRandomly-numbered ElementsDiscrete MathematicsCombinatorial OptimizationComputational GeometryProbabilistic Graph TheoryCircular ElementsSocial Network AnalysisGeometric Graph TheoryComputer ScienceNetwork TheoryHigh SpeedDirected Line SegmentsNetwork ScienceGraph TheoryTopological OrderingNetwork Topology
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.