An Efficient Algorithm for Shortest Path Tree in Dynamic Graph - Shristi Maurya - Livres - LAP LAMBERT Academic Publishing - 9783659310133 - 26 mars 2014
Si la couverture et le titre ne correspondent pas, le titre est correct.

An Efficient Algorithm for Shortest Path Tree in Dynamic Graph

Shristi Maurya

Prix
€ 48,99

Commandé depuis un entrepôt distant

Livraison prévue 3 - 12 mars
Ajouter à votre liste de souhaits iMusic

An Efficient Algorithm for Shortest Path Tree in Dynamic Graph

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.

Médias Livres     Paperback Book   (Livre avec couverture souple et dos collé)
Validé 26 mars 2014
ISBN13 9783659310133
Éditeurs LAP LAMBERT Academic Publishing
Pages 68
Dimensions 150 × 4 × 226 mm   ·   113 g
Langue et grammaire English