Header menu link for other important links
X
The problem of computing k-disjoint maximal cliques covering a maximum number of vertices for weakly triangulated graph
Published in Institute of Electrical and Electronics Engineers Inc.
2014
Pages: 234 - 241
Abstract
In this paper, a problem of a special class of graph is proved to be NP-complete. The problem is to compute k number of vertex disjoint maximal cliques covering a maximum number of vertices of a graph. The precise graph class considered in this paper is weakly triangulated graph; a class of graph belonging to the domain of perfect graph. There exists immense number of applications by solution of the problem in some graph classes, for which it is polynomially computable, such as comparability graph. © 2014 The Science and Information (SAI) Organization.
About the journal
JournalData powered by TypesetProceedings of 2014 Science and Information Conference, SAI 2014
PublisherData powered by TypesetInstitute of Electrical and Electronics Engineers Inc.
Open AccessNo