Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
An Efficient Algorithm for Shortest Path Tree in Dynamic Graph

An Efficient Algorithm for Shortest Path Tree in Dynamic Graph

Maurya Neerajkumar

Paperback

General Computers

ISBN10: 3659310131
ISBN13: 9783659310133
Publisher: Lap Lambert Academic Pub
Published: Mar 26 2014
Pages: 68
Weight: 0.25
Height: 0.16 Width: 6.00 Depth: 9.00
Language: English
Graph theory is branch of science, which has a wide application in fields of Engineering, Science and management. Graph theory enables us to represent any data in the form of nodes and the relations between them. Now a days as data is increasing exponentially it is very difficult to manage and analyze them, where one has to find all the possibilities and combinations like in the field of Networking, Bio-Technology, Database Management etc. Data may change their behavior very frequently, and it is time consuming to start all the calculation from the starting in this Dynamic Graph. Here we have proposed one approach to minimize time complexity for this type of graph, just by focusing on the affected part of the Graph.

Also in

General Computers

View All