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 ...
The Study of Cycles in 2-connected Graphs Specifically Odd Graphs
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
Counting the number of cycles in an undirected graph is a classical problemwhich
is known to be intractable and so research on this problem typically focuses on approximation
algorithms, special cases, heuristics and some ...
Downsampling of signals on graphs: an algebraic perspective
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
Real-world data such as weather data, seismic activity data, sensor networks data and social network data can be represented and processed conveniently using a mathematical structure called Graph. Graphs are a collection ...