Trending Bestseller

An Efficient Algorithm for Shortest Path Tree in Dynamic Graph

No reviews yet Write a Review
Paperback / softback
26 March 2014
RRP: $52.14
$51.10
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:
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.
Product Details
ISBN-13
9783659310133
Author
Maurya Neerajkumar
Publisher
KS OmniScriptum Publishing
Published
26 March 2014
Format
Paperback / softback

This product hasn't received any reviews yet. Be the first to review this product!

RRP: $52.14
$51.10
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:

An Efficient Algorithm for Shortest Path Tree in Dynamic Graph

RRP: $52.14
$51.10

Description

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.