• Parametric classification of directed acyclic graphs, A 

        Author(s):Chaturvedi, Mmanu
        Date Issued:2017
        Format:born digital; masters theses
        We consider four NP-hard optimization problems on directed acyclic graphs (DAGs), namely, max clique, min coloring, max independent set and min clique cover. It is well-known that these four problems can be solved in ...