## Abstract

This paper presents an algorithm for Shortest Path Tree (SPT) problem. The presented algorithm is an improvement over a previously published work of the authors. The effort is put in to improve the running/execution time of the SPT problem. Introduced improvement is simple and easy to incorporate in to the existing algorithm. This algorithm uses Depth First Search (DFS) like graph traversal during a BFS like traversal i.e. combines and take advantage of the inherent properties of the two heuristic graph search techniques so that vertex weights can be kept balanced. The need of improvement is discussed in detail and the expected improvement in overall processing time is shown with the example.

Original language | English |
---|---|

Title of host publication | Proceedings of the ISCI 2011 - 2011 IEEE Symposium on Computers and Informatics |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 119-124 |

Number of pages | 6 |

ISBN (Electronic) | 9781612846910 |

ISBN (Print) | 9781612846897 |

DOIs | |

Publication status | Published - 21 Jul 2011 |

Event | 2011 IEEE Symposium on Computers and Informatics, ISCI 2011 - Kuala Lumpur, Malaysia Duration: 20 Mar 2011 → 22 Mar 2011 |

### Conference

Conference | 2011 IEEE Symposium on Computers and Informatics, ISCI 2011 |
---|---|

Country/Territory | Malaysia |

City | Kuala Lumpur |

Period | 20/03/11 → 22/03/11 |

## Keywords

- algorithm
- graph theory
- shortest path problem
- theoretical computer science (TCS)