Topological ordering of a list of randomly-numbered elements of a network
From MaRDI portal
Publication:3283231
DOI10.1145/355578.366314zbMath0101.10603OpenAlexW2009692318WikidataQ130099750 ScholiaQ130099750MaRDI QIDQ3283231
Publication date: 1961
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355578.366314
Related Items (2)
Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence ⋮ A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
This page was built for publication: Topological ordering of a list of randomly-numbered elements of a network
