Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Some Algorithms on Intersection Graphs - Sambhu Charan Barman

inglise keel
2013-07-20
77,48 € 110,68 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 12-18 tööpäeva jooksul

30-päevane tagastamisõigus

In this monograph, we have designed some sequential algorithm to solve some problems on interval graphs, permutation graphs and trapezoid graphs. In chapter 1, we have discussed the definitions, recognitions, applications, survey, etc. of the Interval, permutation and trapezoid graphs. In second chapter we have designed an O(n) time algorithm to solve minimum k-neighbourhood-covering problem on interval gra ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

In this monograph, we have designed some sequential algorithm to solve some problems on interval graphs, permutation graphs and trapezoid graphs. In chapter 1, we have discussed the definitions, recognitions, applications, survey, etc. of the Interval, permutation and trapezoid graphs. In second chapter we have designed an O(n) time algorithm to solve minimum k-neighbourhood-covering problem on interval graphs. We also present efficient algorithms to find next-to-shortest path between any pair of vertices on permutation graphs and trapezoid graphs with n vertices which run in O(n^2) time in chapter 3 and chapter 5 respectively. In chapter 4, we present an O(n^2) time algorithm to find a minimum 2-tuple dominating set on permutation graphs with n vertices. Also in chapter 6, we present an algorithm to find a tree 4-spanner on trapezoid graphs in O(n) time, and in chapter 7, an O(n^2) time algorithm is presented to find a tree 3-spanner on trapezoid graphs, where n is the number of vertices of the graph. Finally, chapter 8 contains some concluding remarks and scopes of further research on the problems that have been studied in the monograph.

Lisateave

Autor Sambhu Charan Barman
Kirjastaja LAP LAMBERT Academic Publishing
Väljalaskeaasta 2013
Kaanetüüp Pehme kaanega
EAN 9783659427367
Kirjuta oma arvustus
Te vaatate: Some Algorithms on Intersection Graphs
Teie hinnang:

Goodreads'i arvustused

77,48 € 110,68 €