Results 231 to 240 of about 8,970,965 (255)
Distance-hereditary graphs are clique-perfect
In this paper, we show that the clique-transversal number τC(G) and the clique-independence number αC(G) are equal for any distance-hereditary graph G. As a byproduct of proving that τC(G)=αC(G), we give a linear-time algorithm to find a minimum clique ...
Maw Shang Chang, Chuan-Min Lee
exaly +2 more sources
Algorithmic aspects of clique-transversal and clique-independent sets
A minimum clique-transversal set MCT (G) of a graph G=(V; E) is a set S V of minimum cardinality that meets all maximal cliques in G. A maximum clique-independent set MCI(G) of G is a set of maximum number of pairwise vertex-disjoint maximal cliques.
Venkatesan Guruswami +1 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A review on algorithms for maximum clique problems
European Journal of Operational Research, 2015Jin-Kao Hao, Qinghua Wu
exaly
Understanding Processes of Peer Clique Influence in Late Childhood and Early Adolescence
Child Development Perspectives, 2017Lynne Zarbatany
exaly

