Linear-time certifying algorithms for recognizing trivially perfect graphs
نویسندگان
چکیده
We give the first linear-time certifying algorithms to recognize trivially perfect graphs, with sublinear certificates for negative output. In case of membership in the class of trivially perfect graphs, our algorithms provide as certificate a structure for the input graph that characterizes the class, and in case of non-membership they provide as certificate a forbidden induced subgraph of the class. The certificates of membership can be authenticated in time O(n + m) and the certificates of non-membership can be authenticated in time O(n).
منابع مشابه
Linear-time certifying algorithms for recognizing split graphs and related graph classes∗
We give the first linear-time certifying algorithms to recognize split graphs, threshold graphs, bipartite chain graphs, cobipartite chain graphs and trivially perfect graphs, with sublinear certificates for negative output. In case of membership in a given graph class our algorithms provide as certificate a structure for the input graph that characterizes the class, and in case of non-membersh...
متن کاملLinear-time certifying recognition algorithms and forbidden induced subgraphs
We give the first linear-time certifying algorithms to recognize split graphs, threshold graphs, chain graphs, co-chain graphs and trivially perfect graphs, with sublinear certificates for negative output. In case of membership in a given graph class our algorithms provide as certificate a structure for the input graph that characterizes the class, and in case of non-membership they provide as ...
متن کاملProper Helly Circular-Arc Graphs
A circular-arc model M = (C,A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has the same length then M is a unit circular-arc model and if A satisfies the Helly Property then M is a Helly circular-arc model. A (proper) (unit) (Helly) circular-arc graph is the intersection graph of the arcs of a (...
متن کاملCertifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
We give two new algorithms for recognizing proper circulararc graphs and unit circular-arc graphs. The algorithms either provide a model for the input graph, or a certificate that proves that such a model does not exist and can be authenticated in O(n) time.
متن کاملProbe threshold and probe trivially perfect graphs
7 An undirected graph G = (V,E) is a probe C graph if its vertex set can be partitioned 8 into two sets, N (non-probes) and P (probes) where N is independent and there 9 exists E′ ⊆ N × N such that G′ = (V,E ∪ E′) is a C graph. In this article we 10 investigate probe threshold and probe trivially perfect graphs and characterise them 11 in terms of certain 2-Sat formulas and in other ways. For t...
متن کامل