Proceedings ArticleDOI
The problem of computing k-disjoint maximal cliques covering a maximum number of vertices for weakly triangulated graph
Sumana Bandyopadhyay,Rajat Kumar Pal +1 more
- pp 234-241
Reads0
Chats0
TLDR
A problem of a special class of graph is proved to be NP-complete, to compute k number of vertex disjoint maximal cliques covering a maximum number of vertices of a graph.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.read more
References
More filters
Book ChapterDOI
Introduction to Algorithms
TL;DR: This chapter provides an overview of the fundamentals of algorithms and their links to self-organization, exploration, and exploitation.
Journal ArticleDOI
Weakly triangulated graphs
TL;DR: A class of graphs is introduced which includes both triangulated graphs and complements of triangulate graphs, and a structural theorem leads to a proof that weakly triangulation graphs are perfect.
Journal ArticleDOI
ω-Perfect graphs
S. E. Markosyan,G. S. Gasparyan +1 more
TL;DR: In this paper, a bound on the chromatic number for graphs without even holes is derived, and some classes of ω-perfect graphs are described, although the characterization of the complete class of perfect graphs remains an open question.