<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Collection:</title>
    <link>http://202.88.229.59:8080/xmlui/handle/123456789/2332</link>
    <description />
    <pubDate>Tue, 14 Apr 2026 20:02:21 GMT</pubDate>
    <dc:date>2026-04-14T20:02:21Z</dc:date>
    <image>
      <title>DSpace Collection:</title>
      <url>http://localhost:80/jspui/retrieve/b9fac32e-6f7b-4f1c-bf11-e59fea394a38/IMG_6546.JPG</url>
      <link>http://202.88.229.59:8080/xmlui/handle/123456789/2332</link>
    </image>
    <item>
      <title>A STUDY ABOUT FUNDAMENTAL GROUP IN ALGEBRAIC TOPOLOGY</title>
      <link>http://202.88.229.59:8080/xmlui/handle/123456789/2545</link>
      <description>Title: A STUDY ABOUT FUNDAMENTAL GROUP IN ALGEBRAIC TOPOLOGY
Authors: Asst.Prof.Himma Annie Jose
Abstract: The research paper deals with the study of&#xD;
Fundamental Group with the help of examples and some of its&#xD;
applications. In the mathematical field of algebraic topology,&#xD;
the Fundamental Group records information about the basic&#xD;
shape, or holes, of the topological space. The concept of&#xD;
Fundamental Group has been detailed with the help of some&#xD;
theorems and lemmas. Preliminaries are being discussed&#xD;
before moving to the main part.</description>
      <pubDate>Fri, 01 Nov 2019 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://202.88.229.59:8080/xmlui/handle/123456789/2545</guid>
      <dc:date>2019-11-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>COMPARATIVE STUDY OF MINIMAL SPANNING TREE ALGORITHM AND FLOYDS ALGORITHM USED IN SHORTEST PATH PROBLEM.</title>
      <link>http://202.88.229.59:8080/xmlui/handle/123456789/2544</link>
      <description>Title: COMPARATIVE STUDY OF MINIMAL SPANNING TREE ALGORITHM AND FLOYDS ALGORITHM USED IN SHORTEST PATH PROBLEM.
Authors: Asst.Prof.Himma Annie Jose
Abstract: The report is concerned with shortest path problem. It concentrates on two shortest path algorithms. That are Floyd's algorithm and minimal&#xD;
spanning tree algorithm. The first algorithm finds the shortest path by using weights. The travelling salesman problem arises in many different&#xD;
contexts. In this paper we report on typical applications in Telecommunications, Crew scheduling problem, Drilling of printed circuit boards, X-ray&#xD;
crystallography, and Vehicle routing. Most applications originated from real world problems and thus seem to be of particular interest.</description>
      <pubDate>Sat, 01 Dec 2018 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://202.88.229.59:8080/xmlui/handle/123456789/2544</guid>
      <dc:date>2018-12-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

