Search
Now showing items 1-3 of 3
The Study of Vertex Coloring Algorithms Using Heuristic Approaches
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
Graph vertex coloring is one of the most studied NP-complete optimization problem (READ, 1972) [2]. The problem is that; given a graph G, determine the number of colors required to color G, so that no two adjacent vertices ...
Set labeling of graphs
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
Given a universal set and its subsets, intersection graph can be characterized as
the graph with one distinct subset of given universal set for each vertex of the
graph and any two non-adjacent vertices have no element ...
Crime information extraction from news articles
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
In the modern era all news reportings are available in digital form. Most newsagencies put it on their website and are freely available. This motivates us totry extracting some information from online news reporting. While ...