20 research outputs found
Recognizing clique graphs of directed edge path graphs
Directed edge path graphs are the intersection graphs of directed paths in a directed tree, viewed as sets of edges. They were studied by Monma and Wei (J. Comb. Theory B 41 (1986) 141-181) who also gave a polynomial time recognition algorithm. In this work, we show that the clique graphs of these graphs are exactly the two sections of the same kind of path families, and give a polynomial time recognition algorithm for them.Facultad de Ciencias Exacta
Recognizing clique graphs of directed edge path graphs
AbstractDirected edge path graphs are the intersection graphs of directed paths in a directed tree, viewed as sets of edges. They were studied by Monma and Wei (J. Comb. Theory B 41 (1986) 141–181) who also gave a polynomial time recognition algorithm. In this work, we show that the clique graphs of these graphs are exactly the two sections of the same kind of path families, and give a polynomial time recognition algorithm for them
Recognizing clique graphs of directed edge path graphs
Directed edge path graphs are the intersection graphs of directed paths in a directed tree, viewed as sets of edges. They were studied by Monma and Wei (J. Comb. Theory B 41 (1986) 141-181) who also gave a polynomial time recognition algorithm. In this work, we show that the clique graphs of these graphs are exactly the two sections of the same kind of path families, and give a polynomial time recognition algorithm for them.Facultad de Ciencias Exacta
Recognizing clique graphs of directed and rooted path graphs
AbstractWe describe characterizations for the classes of clique graphs of directed and rooted path graphs. The characterizations relate these classes to those of clique-Helly and strongly chordal graphs, respectively, which properly contain them. The characterizations lead to polynomial time algorithms for recognizing graphs of these classes
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Clique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, we presented a proof that the clique graph recognition problem is NP-complete [L. Alcón, L. Faria, C.M.H. de Figueiredo, M. Gutierrez, Clique graph recognition is NP-complete, in: Proc. WG 2006, in: Lecture Notes in Comput. Sci., vol. 4271, Springer, 2006, pp. 269-277]. In this work, we consider the decision problems: given a graph G = (V, E) and an integer k ≥ 0, we ask whether there exists a subset V ′ ⊆ V with | V ′ | ≥ k such that the induced subgraph G [V ′ ] of G is, variously, a clique, clique-Helly or hereditary clique-Helly graph. The first problem is clearly NP-complete, from the above reference; we prove that the other two decision problems mentioned are NP-complete, even for maximum degree 6 planar graphs. We consider the corresponding maximization problems of finding a maximum induced subgraph that is, respectively, clique, clique-Helly or hereditary clique-Helly. We show that these problems are Max SNP-hard, even for maximum degree 6 graphs. We show a general polynomial-time frac(1, Δ + 1)-approximation algorithm for these problems when restricted to graphs with fixed maximum degree Δ. We generalize these results to other graph classes. We exhibit a polynomial 6-approximation algorithm to minimize the number of vertices to be removed in order to obtain a hereditary clique-Helly subgraph.Facultad de Ciencias Exacta
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Clique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, we presented a proof that the clique graph recognition problem is NP-complete [L. Alcón, L. Faria, C.M.H. de Figueiredo, M. Gutierrez, Clique graph recognition is NP-complete, in: Proc. WG 2006, in: Lecture Notes in Comput. Sci., vol. 4271, Springer, 2006, pp. 269-277]. In this work, we consider the decision problems: given a graph G = (V, E) and an integer k ≥ 0, we ask whether there exists a subset V ′ ⊆ V with | V ′ | ≥ k such that the induced subgraph G [V ′ ] of G is, variously, a clique, clique-Helly or hereditary clique-Helly graph. The first problem is clearly NP-complete, from the above reference; we prove that the other two decision problems mentioned are NP-complete, even for maximum degree 6 planar graphs. We consider the corresponding maximization problems of finding a maximum induced subgraph that is, respectively, clique, clique-Helly or hereditary clique-Helly. We show that these problems are Max SNP-hard, even for maximum degree 6 graphs. We show a general polynomial-time frac(1, Δ + 1)-approximation algorithm for these problems when restricted to graphs with fixed maximum degree Δ. We generalize these results to other graph classes. We exhibit a polynomial 6-approximation algorithm to minimize the number of vertices to be removed in order to obtain a hereditary clique-Helly subgraph.Facultad de Ciencias Exacta
A generalization of the helly property applied to the cliques of a graph
Let p ≥ 1 and q ≥ 0 be integers. A family S of sets is (p,q)-intersecting when every subfamily S' ⊆ S formed by p or less members has total intersection of cardinality at least q. A family F of sets is (p,q)-Helly when every (p,q)-intersecting subfamily F' ⊆ F has total intersection of cardinality at least q. A graph G is a (p, q)-
clique-Helly graph when its family of cliques (maximal complete sets) is (P, q)-Helly. According to this terminology, the usual Helly property and the clique-Helly graphs correspond to the case p = 2, q = 1. In this work we present characterizations for (p,q)-Helly families of sets and (p,q)-clique-Helly graphs. For fixed p,q those characterizations lead to polynomial-time recognition algorithms. When p or q is not fixed, it is shown that the recognition of (p,q)-clique-Helly graphs is NP-hard. We also extend further the notions presented, by defining the (p,q, r)-Helly property (which holds when every (p, q)-intersecting subfamily F' ⊆ F has total intersection of cardinality at least r) and giving a way of recognizing (p, q, r)-Helly families in terms of the (p, q)-Helly property
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Clique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, we presented a proof that the clique graph recognition problem is NP-complete [L. Alcón, L. Faria, C.M.H. de Figueiredo, M. Gutierrez, Clique graph recognition is NP-complete, in: Proc. WG 2006, in: Lecture Notes in Comput. Sci., vol. 4271, Springer, 2006, pp. 269-277]. In this work, we consider the decision problems: given a graph G = (V, E) and an integer k ≥ 0, we ask whether there exists a subset V ′ ⊆ V with | V ′ | ≥ k such that the induced subgraph G [V ′ ] of G is, variously, a clique, clique-Helly or hereditary clique-Helly graph. The first problem is clearly NP-complete, from the above reference; we prove that the other two decision problems mentioned are NP-complete, even for maximum degree 6 planar graphs. We consider the corresponding maximization problems of finding a maximum induced subgraph that is, respectively, clique, clique-Helly or hereditary clique-Helly. We show that these problems are Max SNP-hard, even for maximum degree 6 graphs. We show a general polynomial-time frac(1, Δ + 1)-approximation algorithm for these problems when restricted to graphs with fixed maximum degree Δ. We generalize these results to other graph classes. We exhibit a polynomial 6-approximation algorithm to minimize the number of vertices to be removed in order to obtain a hereditary clique-Helly subgraph.Facultad de Ciencias Exacta
The complexity of clique graph recognition
A complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique is a maximal complete set. Denote by C (G) the clique family of G. The clique graph of G, denoted by K (G), is the intersection graph of C (G). Say that G is a clique graph if there exists a graph H such that G = K (H). The clique graph recognition problem asks whether a given graph is a clique graph. A sufficient condition was given by Hamelink in 1968, and a characterization was proposed by Roberts and Spencer in 1971. However, the time complexity of the problem of recognizing clique graphs is a long-standing open question. We prove that the clique graph recognition problem is NP-complete.Facultad de Ciencias Exacta