Graph Classes based on Interval Structures: Combinatorial Optimization and Recognition of Graph Classes with Applications to Rel,Used

Graph Classes based on Interval Structures: Combinatorial Optimization and Recognition of Graph Classes with Applications to Rel,Used

In Stock
SKU: DADAX3838111958
Brand: Sudwestdeutscher Verlag Fur Hochschulschriften AG
$156.96 $224.23
Save $67.27
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

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 nontrivial intersection model, given by threedimensional parallelepipeds, which enables the design of efficient algorithms for some NPhard optimization problems. Furthermore, we prove that both recognition problems for tolerance and bounded tolerance graphs are NPcomplete, thereby settling a long standing open question since 1982.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed