University of Calcutta (informally known as Calcutta University or CU) is a collegiate public state university located in Kolkata, West Bengal, India.&nbsp;Within India it is recognized as a &quot;Five-Star University&quot; and accredited &quot;A&quot; Grade by National Assessment and Accreditation Council.

&nbsp;

The University of Calcutta has secured the Fifth position among the Universities of India in the prestigious &quot;Indian University Ranking 2019&quot; list, released by the NIRF of the Ministry of Human Resource Development, Government of India.

&nbsp;

It was established on 24 January 1857, and was one of the first institutions in Asia to be established as a multidisciplinary and Western-style university. Its alumni and faculty include several heads of state, heads of government, social reformers, prominent artists, only academy award winner and Dirac medal winner in India, many Fellows of the Royal Society and five Nobel laureates as of 2019 which is highest in South Asia.

University Of Calcutta

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.

Geography

Computer Science and Engineering

Proceedings of 2014 Science and Information Conference, SAI 2014

The problem of computing k-disjoint maximal cliques covering a maximum number of vertices for weakly triangulated graph

In this paper, we have addressed the computation of an invariant of weakly triangulated graph. The invariant computed here are all possible maximal cliques of the specific graph class. The logic of computing all possible maximal cliques of weakly triangulated graph is based on one of its prime characterization, i.e., existence of more than one 2-pair in a weakly triangulated graph. For each graph belonging to such a class there exists a sequence of 2-pairs whose successive merging leads the graph into a complete one. In a reverse way successive decomposition of vertices of the obtained complete graph ultimately yields some non-decomposable induced subgraph of the original weakly triangulated graph. These non-decomposable induced subgraphs are not only maximal cliques, but subcliques or redundant occurrences of the same maximal cliques. Our algorithm proposed in this paper, while breaking by 2-pairs produces only maximal cliques in O(n 3 log -E-) time for a weakly triangulated graph G = (V, E), where V = n. The paper along with the algorithm contains necessary theorems, lemmas, etc., proving that the algorithm invented here terminates successfully and produces the desired maximal cliques only. © 2014 The Science and Information (SAI) Organization.

Computation of all possible maximal cliques of a weakly triangulated graph in polynomial time

The most popular electronic media television snatches out at least a few minutes from all of our daily life. Therefore, it is natural that various production units will try to figure out the most popular programmes during which they can launch advertisements of their products. In this paper, the problem is depicted from the graphical point of view and comparability graph is used to model the problem. As the paper aims to find out k parallel disjoint sessions (nonintersecting programme slots) that reach to a largest number of viewers, the problem turns into computing a maximum weighted k clique in the comparability graph (the graph is weighted by the television rating of each programme). © 2011 IEEE.

Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011

An algorithm for selecting programme slots to broadcast advertisements in parallel in different television channels

The most popular electronic media television snatches out at least a few minutes from all of our daily life. Therefore, it is natural that various production units will try to figure out the most popular programmes during which they can launch advertisements of their products. In this paper, the problem is depicted from the graphical point of view. Vertices denote the programmes on different channels and edges are introduced to denote time dependencies among the programmes broadcasted on different channels. In this paper, the graph obtained in this way is a kind of perfect graph, specifically, it is known as comparability graph. As the paper aims to find out nonintersecting programme slots that reach to a largest number of viewers, the problem turns into computing a maximum weighted clique in the comparability graph (the graph is weighted by the number of viewers of each programme).