An Efficient Algorithm For Shortest Path Tree In Dynamic Graph - Brossura

Maurya, Neerajkumar; Maurya, Shristi

 
9783659310133: An Efficient Algorithm For Shortest Path Tree In Dynamic Graph
Brossura
ISBN 10: 3659310131 ISBN 13: 9783659310133
Casa editrice: LAP LAMBERT Academic Publishing, 2014

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

L'autore

Er. Neerajkumar Maurya has received B.E. Computer Engineering in June 2008 & M.E. Computer Engineering in 2014 from Mumbai University. He has been working in the field of Graph theory, Database, Compilers, Operating Systems And Artificial Intelligence mainly.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
LAP LAMBERT Academic Publishing
Data di pubblicazione
2014
Lingua
Inglese
ISBN 10 
3659310131
ISBN 13 
9783659310133
Rilegatura
Copertina flessibile
Numero di pagine
68
Contatto del produttore
non disponibile
Persona responsabile
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Germania