20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

An Efficient Algorithm For Shortest Path Tree In Dynamic Graph - Shristi Maurya,Neerajkumar Maurya

English
2014-03-26
€45.94 €57.42

-20% with code BOOKS

In stock at our supplier

Shipping in 12-18 days

30-day return policy

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-Tech ... Full description

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.

More Information

Author Shristi Maurya, Neerajkumar Maurya
Publisher LAP LAMBERT Academic Publishing
Release year 2014
Cover type Softcover
EAN 9783659310133
Write Your Own Review
You're reviewing: An Efficient Algorithm For Shortest Path Tree In Dynamic Graph
Your Rating:

Goodreads Reviews

€45.94 €57.42