A Dichotomy on Constrained Topological Sorting

    Charles Paperman
    Charles Paperman

    arXiv: Data Structures and Algorithms, Volume abs/1707.04310, 2017.

    Cited by: 0|Bibtex|Views0|Links
    EI

    Abstract:

    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

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments