Some Algorithms on Intersection Graphs - 5 Angebote vergleichen
| Preise | 2013 | 2014 | 2015 |
|---|---|---|---|
| Schnitt | Fr. 68.36 (€ 69.90)¹ | Fr. 66.79 (€ 68.30)¹ | Fr. 81.34 (€ 83.18)¹ |
| Nachfrage |
1
Some Algorithms on Intersection Graphs
DE PB NWISBN: 9783659427367 bzw. 3659427365, in Deutsch, LAP LAMBERT Academic Publishing, Taschenbuch, neu.
Von Händler/Antiquariat, BuySomeBooks [52360437], Las Vegas, NV, U.S.A.
Paperback. 220 pages. Dimensions: 8.7in. x 5.9in. x 0.5in.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(n2) time in chapter 3 and chapter 5 respectively. In chapter 4, we present an O(n2) time algorithm to find a minimum 2-tuple ***ting 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(n2) 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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN.
Paperback. 220 pages. Dimensions: 8.7in. x 5.9in. x 0.5in.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(n2) time in chapter 3 and chapter 5 respectively. In chapter 4, we present an O(n2) time algorithm to find a minimum 2-tuple ***ting 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(n2) 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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN.
2
Some Algorithms on Intersection Graphs (2015)
DE PB NWISBN: 9783659427367 bzw. 3659427365, in Deutsch, LAP LAMBERT ACADEMIC PUB 01/01/2015, Taschenbuch, neu.
Von Händler/Antiquariat, Books2Anywhere [190245], Fairford, United Kingdom.
New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. This item is printed on demand.
New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. This item is printed on demand.
4
Some Algorithms on Intersection Graphs (2015)
DE PB NWISBN: 9783659427367 bzw. 3659427365, in Deutsch, LAP LAMBERT ACADEMIC PUB 01/03/2015, Taschenbuch, neu.
Von Händler/Antiquariat, Paperbackshop-US [8408184], Secaucus, NJ, U.S.A.
New Book. Shipped from US within 10 to 14 business days. Established seller since 2000. This item is printed on demand.
New Book. Shipped from US within 10 to 14 business days. Established seller since 2000. This item is printed on demand.
5
Some Algorithms on Intersection Graphs (2013)
DE PB NW RPISBN: 9783659427367 bzw. 3659427365, in Deutsch, LAP Lambert Academic Publishing, Taschenbuch, neu, Nachdruck.
Von Händler/Antiquariat, English-Book-Service - A Fine Choice [1048135], Waldshut-Tiengen, Germany.
This item is printed on demand for shipment within 3 working days.
This item is printed on demand for shipment within 3 working days.
Lade…