Improvements Over Two Phase Shortest Path Algorithm

QR Code

Improvements Over Two Phase Shortest Path Algorithm

Shortest path is an old classical problem in the area of theoretical computer science. This work is the continuation of the work done previously by the authors and presents two possible improvements in the existing algorithm. The introduced improvements which are simple and fit in easily into the ex...

Full description

Bibliographic Details
Main Authors:	Qureshi, M.A., Hassan, M.F.
Format:	Conference or Workshop Item
Language:	English
Published:	2010
Subjects:	QA75 Electronic computers. Computer science QA76 Computer software
Online Access:	http://scholars.utp.edu.my/id/eprint/3147/ http://scholars.utp.edu.my/id/eprint/3147/1/stamp.jsp%3Ftp%3D%26arnumber%3D5561538%26tag%3D1

Similar Items

Two Phase Shortest Path Algorithm for Non-Negative Undirected Graphs
by: Qureshi, MA., et al.
Published: (2010)

A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
by: Qureshi, M.A., et al.
Published: (2010)

An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
by: Qureshi, M.A., et al.
Published: (2010)

A genetic algorithm solution to the shortest path problem in OSPF and MPLS / by Tee Wee Jing.
by: Tee Wee Jing, Wee Jing
Published: (2002)

Hopfield model for shortest path computation and routing in ATM network / by Lee Chee Weng
by: Lee, Chee Weng
Published: (2001)

Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
by: Nurul Hani , Nortaja
Published: (2004)

Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019)

Load Optimization with Shortest Distance Approach
by: Yusria, Lenitasari, et al.
Published: (2022)

A new particle swarm optimization based algorithm for solving shortest-paths tree problem
by: Mohemmed, Ammar W., et al.
Published: (2007)

Moving Towards Two Dimensional Passwords
by: Safdar, S., et al.
Published: (2010)

Constraint Relaxation Approach for Over-Constrained Agent Interaction
by: Hassan, M.F., et al.
Published: (2008)

Solving shortest path problem using particle swarm optimization
by: Mohemmed, Ammar W., et al.
Published: (2008)

Framework for Alternate Execution of Workflows Under Threat
by: Safdar, S., et al.
Published: (2010)

Biologically Inspired Execution Framework for Vulnerable Workflow Systems
by: Safdar, S., et al.
Published: (2009)

Client’s Perspective: Realization as a New Generation Process for Software Project Development and Management
by: Akbar, R., et al.
Published: (2010)

Paraphrase Detection using Semantic Relatedness based on Synset Shortest Path in WordNet
by: Lee, Jun Choi, et al.
Published: (2016)

Authentication Model Based on Reformation Mapping Method
by: Safdar, S., et al.
Published: (2010)

Particle swarm optimization with noising metaheuristics for solving network shortest path problem
by: Mohemmed, Ammar W., et al.
Published: (2007)

An Approach to Derive Parametric L-System Using Genetic Algorithm
by: Farooq, H., et al.
Published: (2009)

Efficient Computation of Shortest Paths in Networks Using Particle Swarm Optimization and Noising Metaheuristics
by: Mohemmed, Ammar W., et al.
Published: (2007)

A Multidimensional Search Space Using Interactive Genetic Algorithm
by: Farooq, H., et al.
Published: (2010)

A study on lower bound of direct proportional length-based DNA computing for shortest path problem
by: Ibrahim, Zuwairie, et al.
Published: (2005)

Experimental implementation of direct-proportional length-based dna computing for numerical optimization of the shortest path problem
by: Ibrahim, Zuwairie, et al.
Published: (2007)

Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia
by: Ahmad, Ab. Rahman, et al.
Published: (2005)

Hybrid concentration-controlled direct-proportional length-based DNA computing for numerical optimization of the shortest path problem
by: Ibrahim, Zuwairie, et al.
Published: (2006)

Algorithm for enhancing the QoS of video traffic over wireless mesh networks
by: A. Moh, Abdul Nasser, et al.
Published: (2019)

Particle Swarm Optimization Combined with Local Search and Velocity Re-Initialization for Shortest Path Computation in Networks
by: Mohemmed, Ammar W., et al.
Published: (2007)

Coordinated Constraint Relaxation Using a Distributed Agent Protocol
by: Hassan, M.F.
Published: (2007)

Efficient skyline processing algorithm over dynamic and incomplete database
by: Babanejad, Ghazaleh, et al.
Published: (2018)

A hybrid algorithm for finding shortest path in network routing.
by: Soltan Aghaei, Mohammad Reza, et al.
Published: (2009)

Constraint relaxation to reduce brittleness of distributed agent protocols
by: Hassan, M.F., et al.
Published: (2004)

Quality model for web services from multi-stakeholders' perspective
by: Balfagih, Z., et al.
Published: (2009)

Addressing the Brittleness of Agent Interaction
by: Hassan, M.F., et al.
Published: (2008)

Single and Replicated Simulations for Colored Petri Nets Nondeterministic Network
by: Adhipta, D., et al.
Published: (2010)

A Collaborative-Interaction Model of Software Project Development: An Extension to Agile Based Methodologies
by: Akbar, R., et al.
Published: (2010)

Agent based Monitoring Framework for SOA Applications Quality
by: Balfagih, Z., et al.
Published: (2010)

Limitations and Measures in Outsourcing Projects to Geographically Distributed Offshore Teams
by: Akhbar, R., et al.
Published: (2010)

A Survey on Different Interoperability Frameworks of SOA Systems Towards Seamless Interoperability
by: M. Ibrahim, N., et al.
Published: (2010)

Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019)

Improved handover decision algorithm using multiple criteria
by: Mohamed Abdullah, Radhwan, et al.
Published: (2018)