Search

Now showing items 1-6 of 6

The Study of Vertex Coloring Algorithms Using Heuristic Approaches

Lodha, Pratik (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

Thakker, Avani (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 ...

Set labeling of graphs

Kumar, Lokesh (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 ...

Designing an optimized linear adaptive filtering algorithm

Trivedi, Vishwas (Dhirubhai Ambani Institute of Information and Communication Technology, 2018)

For any system, sparse or dispersive, z2 proportionate algorithm of Proportionate Normalized Least Mean Square (PtNLMS) class, gives the best convergence rate compare to any other weiner filter based iterative algorithms. ...

Total graphs properties of total graphs and dynamic construction of total graphs

Sheth, Heli (Dhirubhai Ambani Institute of Information and Communication Technology, 2018)

This thesis involves studying total graphs which are auxiliary graphs used to transform the total colouring problem of a graph into vertex colouring problem of the total graph. Not all graphs are total graphs but each ...

Testing synchronously communicating distributed systems

Vishwakarma, Nikita (Dhirubhai Ambani Institute of Information and Communication Technology, 2018)

In our work we are supposed to test whether the generated distributed implementation(or distributed network) behaves similar to that of given specification. We are doing this over synchronously communicating FSMs(Finite State ...