<?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>DSpace Collection:</title>
  <link rel="alternate" href="http://202.88.229.59:8080/xmlui/handle/123456789/2332" />
  <subtitle />
  <id>http://202.88.229.59:8080/xmlui/handle/123456789/2332</id>
  <updated>2026-04-14T20:02:21Z</updated>
  <dc:date>2026-04-14T20:02:21Z</dc:date>
  <entry>
    <title>A STUDY ABOUT FUNDAMENTAL GROUP IN ALGEBRAIC TOPOLOGY</title>
    <link rel="alternate" href="http://202.88.229.59:8080/xmlui/handle/123456789/2545" />
    <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">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.</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 rel="alternate" href="http://202.88.229.59:8080/xmlui/handle/123456789/2544" />
    <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">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.</summary>
    <dc:date>2018-12-01T00:00:00Z</dc:date>
  </entry>
</feed>

