0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics

Buy Now

Some Sequential and Parallel Algorithms (Paperback) Loot Price: R1,784
Discovery Miles 17 840
Some Sequential and Parallel Algorithms (Paperback): Sukumar Mondal

Some Sequential and Parallel Algorithms (Paperback)

Sukumar Mondal

 (sign in to rate)
Loot Price R1,784 Discovery Miles 17 840 | Repayment Terms: R167 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

This monogram considers certain sequential and parallel algorithms on interval graphs, permutation graphs and trapezoid graphs. These graphs arise quite naturally in real-world applications. I have tried to present a rigorous and coherent theory. Proofs are constructive and are streamlined as much as possible. I have directed much attention to the algorithmic aspects of every problem. Algorithms are expressed in a manner that will make their adaption to a particular programming language relatively easy. The complexity of every algorithm is analyzed so that some measure of its efficiency can be determined. This monogram will be very useful for applied mathematicians and computer scientists at the research level. Many applications of the theoretical and computational aspects of the subject are described throughout the monogram. The topics covered in this monogram have been chosen to fill a vacuum in the literature, and their interrelation.

General

Imprint: Lap Lambert Academic Publishing
Country of origin: Germany
Release date: 2012
First published: 2012
Authors: Sukumar Mondal
Dimensions: 229 x 152 x 11mm (L x W x T)
Format: Paperback - Trade
Pages: 192
ISBN-13: 978-3-8465-8247-3
Categories: Books > Science & Mathematics > Mathematics > General
LSN: 3-8465-8247-6
Barcode: 9783846582473

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners