0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

Graph Separators, with Applications (Hardcover, 2002 ed.) Loot Price: R2,794
Discovery Miles 27 940
Graph Separators, with Applications (Hardcover, 2002 ed.): Arnold L. Rosenberg, Lenwood S. Heath

Graph Separators, with Applications (Hardcover, 2002 ed.)

Arnold L. Rosenberg, Lenwood S. Heath

Series: Frontiers in Computer Science

 (sign in to rate)
Loot Price R2,794 Discovery Miles 27 940 | Repayment Terms: R262 pm x 12*

Bookmark and Share

Expected to ship within 18 - 22 working days

Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while the main focus of the book is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects our perception that the work on upper bounds, or algorithms, for graph separation is much better represented in the standard theory literature than is the work on lower bounds, which we perceive as being much more scattered throughout the literature on application areas. Given the multitude of notions of graph separator that have been developed and studied over the past (roughly) three decades, there is a need for a central, theory-oriented repository for the mass of results. The need is absolutely critical in the area of lower-bound techniques for graph separators, since these techniques have virtually never appeared in articles having the word separator' or any of its near-synonyms in the title. Graph Separators with Applications fills this need.

General

Imprint: Kluwer Academic / Plenum Publishers
Country of origin: United States
Series: Frontiers in Computer Science
Release date: June 2001
First published: 2002
Authors: Arnold L. Rosenberg • Lenwood S. Heath
Dimensions: 235 x 155 x 23mm (L x W x T)
Format: Hardcover
Pages: 257
Edition: 2002 ed.
ISBN-13: 978-0-306-46464-5
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematical modelling
Promotions
LSN: 0-306-46464-0
Barcode: 9780306464645

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!

You might also like..

Reachable Sets of Dynamic Systems…
Stanislaw Raczynski Paperback R3,927 Discovery Miles 39 270
Comprehensive Metaheuristics…
S. Ali Mirjalili, Amir Hossein Gandomi Paperback R3,956 Discovery Miles 39 560
A Textbook of Data Structures and…
Vijayalakshmi P Hardcover R3,522 Discovery Miles 35 220
MATLAB Applications in Engineering
Constantin Volosencu Hardcover R3,055 Discovery Miles 30 550
The Application of Ant Colony…
Ali Soofastaei Hardcover R2,553 Discovery Miles 25 530
Introduction to Chemical Engineering…
Henry C. Foley Paperback R3,120 Discovery Miles 31 200
A Textbook of Data Structures and…
Vijayalakshmi P Hardcover R3,522 Discovery Miles 35 220
Algorithms in Bioinformatics - Theory…
PA Gagniuc Hardcover R3,174 Discovery Miles 31 740
Coding for Kids in Python - Python…
Bob Mather Hardcover R851 Discovery Miles 8 510
Gamma Solution - An Application of…
James R Warren Hardcover R1,232 R1,048 Discovery Miles 10 480
C Programming - C Programming Language…
Adam Dodson Hardcover R551 R505 Discovery Miles 5 050
The Physics of Computing
Marilyn Wolf Paperback R1,645 Discovery Miles 16 450

See more

Partners