A structured program to generate all topological sorting arrangements
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3471564 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3421895 (Why is no real title available?)
- An efficient procedure for the generation of closed subsets
- Backtrack Programming
- Nondeterministic Algorithms
Cited in
(17)- A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
- Transposition generation of alternating permutations
- On extensions, linear extensions, upsets and downsets of ordered sets
- Thick 2D relations for document understanding
- Applying Young diagrams to 2-symmetric fuzzy measures with an application to general fuzzy measures
- Bottom-up: a new algorithm to generate random linear extensions of a poset
- Topological ordering algorithm for LDAG
- Lexicographic permutations with restrictions
- Generating linear extensions of posets by transpositions
- Reverse search for enumeration
- Topological sorts on DAGs
- Dijkstra graphs
- Virtual network function reconfiguration in 5G networks: an optimization perspective
- scientific article; zbMATH DE number 7376042 (Why is no real title available?)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Evaluating systems of equations: Toward a formal approach
- A survey on the mathematical foundations of axiomatic entropy: representability and orderings
This page was built for publication: A structured program to generate all topological sorting arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1393277)