<?xml version="1.0" encoding="UTF-8"?><feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Asst. Prof. Himma Anni Jose</title>
<link href="http://202.88.229.59:8080/xmlui/handle/123456789/2332" rel="alternate"/>
<subtitle/>
<id>http://202.88.229.59:8080/xmlui/handle/123456789/2332</id>
<updated>2026-04-14T19:43:06Z</updated>
<dc:date>2026-04-14T19:43:06Z</dc:date>
<entry>
<title>A STUDY ABOUT FUNDAMENTAL GROUP IN ALGEBRAIC TOPOLOGY</title>
<link href="http://202.88.229.59:8080/xmlui/handle/123456789/2545" rel="alternate"/>
<author>
<name>Asst.Prof.Himma Annie Jose</name>
</author>
<id>http://202.88.229.59:8080/xmlui/handle/123456789/2545</id>
<updated>2020-07-01T05:55:59Z</updated>
<published>2019-11-01T00:00:00Z</published>
<summary type="text">A STUDY ABOUT FUNDAMENTAL GROUP IN ALGEBRAIC TOPOLOGY
Asst.Prof.Himma Annie Jose
The research paper deals with the study of&#13;
Fundamental Group with the help of examples and some of its&#13;
applications. In the mathematical field of algebraic topology,&#13;
the Fundamental Group records information about the basic&#13;
shape, or holes, of the topological space. The concept of&#13;
Fundamental Group has been detailed with the help of some&#13;
theorems and lemmas. Preliminaries are being discussed&#13;
before moving to the main part.
</summary>
<dc:date>2019-11-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>COMPARATIVE STUDY OF MINIMAL SPANNING TREE ALGORITHM AND FLOYDS ALGORITHM USED IN SHORTEST PATH PROBLEM.</title>
<link href="http://202.88.229.59:8080/xmlui/handle/123456789/2544" rel="alternate"/>
<author>
<name>Asst.Prof.Himma Annie Jose</name>
</author>
<id>http://202.88.229.59:8080/xmlui/handle/123456789/2544</id>
<updated>2020-07-01T06:03:21Z</updated>
<published>2018-12-01T00:00:00Z</published>
<summary type="text">COMPARATIVE STUDY OF MINIMAL SPANNING TREE ALGORITHM AND FLOYDS ALGORITHM USED IN SHORTEST PATH PROBLEM.
Asst.Prof.Himma Annie Jose
The report is concerned with shortest path problem. It concentrates on two shortest path algorithms. That are Floyd's algorithm and minimal&#13;
spanning tree algorithm. The first algorithm finds the shortest path by using weights. The travelling salesman problem arises in many different&#13;
contexts. In this paper we report on typical applications in Telecommunications, Crew scheduling problem, Drilling of printed circuit boards, X-ray&#13;
crystallography, and Vehicle routing. Most applications originated from real world problems and thus seem to be of particular interest.
</summary>
<dc:date>2018-12-01T00:00:00Z</dc:date>
</entry>
</feed>
