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

DOI10.1145/355578.366314zbMATH Open0101.10603OpenAlexW2009692318WikidataQ130099750 ScholiaQ130099750MaRDI QIDQ3283231FDOQ3283231

Authors: Daniel J. Lasser 

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

zbMATH Keywords

numerical analysis

Cited In (2)

• A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
• Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence

This page was built for publication: Topological ordering of a list of randomly-numbered elements of a network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3283231)