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

Graph Classes based on Interval Structures

 

Marketed By :  Südwestdeutscher Verlag für Hochschulschriften   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

 
 
  • Product Description
 

Interval structures arise naturally in many applications, as in genetics, molecular biology, resource allocation, and scheduling, among others. Such structures are often modeled with graphs, such as interval and tolerance graphs, which have been widely studied. In this book we mainly investigate these classes of graphs, as well as a scheduling problem. We present solutions to some open problems, along with some new representation models that enable the design of new efficient algorithms. In the context of interval graphs, we present the first polynomial algorithm for the longest path problem, whose complexity status was an open question. Furthermore, we introduce two matrix representations for both interval and proper interval graphs, which can be used to derive efficient algorithms. In the context of tolerance graphs, we present the first non-trivial intersection model, given by three-dimensional parallelepipeds, which enables the design of efficient algorithms for some NP-hard optimization problems. Furthermore, we prove that both recognition problems for tolerance and bounded tolerance graphs are NP-complete, thereby settling a long standing open question since 1982.

Product Specifications
SKU :COC43394
AuthorGeorge B. Mertzios
LanguageEnglish
BindingPaperback
Number of Pages164
Publishing Year2010-03-04T00:00:00.000
ISBN978-3838111957
Edition1 st
Book TypeComputer networking & communications
Country of ManufactureIndia
Product BrandSüdwestdeutscher Verlag für Hochschulschriften
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-01-08 00:00:00