A Dichotomy on Constrained Topological Sorting
arXiv: Data Structures and Algorithms, Volume abs/1707.04310, 2017.
introduce the constrained topological sorting problem (CTS-problem): given a target language L and a directed acyclic graph (DAG) G with labeled vertices, determine if G has a topological sort which forms a word that belongs to L. This natural problem applies to several settings, including scheduling with costs or verifying concurrent pr...More
Full Text (Upload PDF)
PPT (Upload PPT)