An Efficient Method for Indexing All Topological Orders of a Directed Graph

DOI10.1007/978-3-319-13075-0_9zbMath1435.05094OpenAlexW50726752MaRDI QIDQ2942618

Yuma Inoue, Shin-ichi Minato

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13075-0_9

zbMATH Keywords

permutationslinear extensionsexperimental algorithmsenumerating algorithmsdecision diagramstopological orders

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Classical length-5 pattern-avoiding permutations ⋮ Decision diagrams for solving a job scheduling problem under precedence constraints

This page was built for publication: An Efficient Method for Indexing All Topological Orders of a Directed Graph