Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

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

angļu valoda
2014-03-26
40,19 € 57,42 €

-30% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 12-18 darba dienu laikā

30 dienu atgriešanas politika

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 ... Pilns apraksts

Aprašymas

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.

Vairāk informācijas

Autors Shristi Maurya, Neerajkumar Maurya
Izdevējs LAP LAMBERT Academic Publishing
Izlaides gads 2014
Vāka tips Mīkstais vāks
EAN 9783659310133
Rakstiet savu atsauksmi
Jūs vērtējat: An Efficient Algorithm For Shortest Path Tree In Dynamic Graph
Jūsu novērtējums:

Goodreads atsauksmes

40,19 € 57,42 €