Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Some Algorithms on Intersection Graphs


Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days


Check Your Delivery Options

Rs. 5,208

Availability: In stock

  • Product Description

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.

Product Specifications
SKU :COC85385
AuthorSambhu Charan Barman
Number of Pages220
Publishing Year2013-07-20T00:00:00.000
Edition1 st
Book TypeMusic
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-10-08 00:00:00