NDLI: Meliorated Approach for Efficient Computation of Shortest Path on Edge Based Data Structure

Content Provider	IEEE Xplore Digital Library
Author	Gupta, A. Maheshwari, A. Jain, G.
Copyright Year	2009
Description	Author affiliation: Department of Computer Engineering Netaji Subhas Institute of Technology, Dwarka New Delhi, India Fax: (91)11-25099022 anand@coe.nsit.ac.in (Gupta, A.) \|\| Department of Computer Engineering Netaji Subhas Institute of Technology, Dwarka New Delhi, India Fax: (91)11-25099022 cruisewithankur@gmail.com (Maheshwari, A.) \|\| Department of Computer Engineering Netaji Subhas Institute of Technology, Dwarka New Delhi, India Fax: (91)11-25099022 gjain23@gmail.com (Jain, G.)
Abstract	The novel representation of the graph using edge based data structure, as proposed in [1] is an adapted version of half edge structure, traditionally used in digital geometry processing [6]. This edge based data structure provides an efficient way for storing and accessing graphs. However the shortest path algorithm implemented in [1] on the above mentioned data structure proves to be inefficient when dealing with extensive graphs with varying scales and degrees. The main concern is to minimize the time and space overheads involved, as they take a great toll on system resources. The short comings associated with the above mentioned approach acted as our motivation. In this paper, we present an approach based on greedy and intuitionist programming strategies, which derives advantages from heuristics that apply to all kinds of graph, hence achieving greater efficiency. This aspect of the algorithm is also borne out by the experimental conclusions we have obtained.
Starting Page	290
Ending Page	295
File Size	5568111
Page Count	6
File Format	PDF
ISBN	9781424429271
DOI	10.1109/IADCC.2009.4809023
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-03-06
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Shortest path problem Computational geometry Solid modeling Network topology Data structures Data engineering Graph theory Telecommunication computing Information systems Global Positioning System
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in