 If this check succeeds for every "v", then the graph is trivially perfect.The algorithm can also be modified to test whether a graph is the complement graph of a trivially perfect graph, in linear time.Determining if a general graph is "k" edge deletions away from a trivially perfect graph is NP-complete, fixed-parameter tractable and can be solved in O(2.45"k"("m" + "n")) time.