0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Mathematical theory of computation

Buy Now

Graph Separators, with Applications (Paperback, Softcover reprint of the original 1st ed. 2002) Loot Price: R2,647
Discovery Miles 26 470
Graph Separators, with Applications (Paperback, Softcover reprint of the original 1st ed. 2002): Arnold L. Rosenberg, Lenwood...

Graph Separators, with Applications (Paperback, Softcover reprint of the original 1st ed. 2002)

Arnold L. Rosenberg, Lenwood S. Heath

Series: Frontiers in Computer Science

 (sign in to rate)
Loot Price R2,647 Discovery Miles 26 470 | Repayment Terms: R248 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: Springer-Verlag New York
Country of origin: United States
Series: Frontiers in Computer Science
Release date: April 2013
First published: 2002
Authors: Arnold L. Rosenberg • Lenwood S. Heath
Dimensions: 235 x 155 x 14mm (L x W x T)
Format: Paperback
Pages: 257
Edition: Softcover reprint of the original 1st ed. 2002
ISBN-13: 978-1-4757-8764-1
Categories: Books > Science & Mathematics > Mathematics > General
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > Applications of computing > General
Promotions
LSN: 1-4757-8764-2
Barcode: 9781475787641

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..

Creativity in Computing and DataFlow…
Suyel Namasudra, Veljko Milutinovic Hardcover R4,204 Discovery Miles 42 040
Agent-Based Modeling and Network…
Akira Namatame, Shu-Heng Chen Hardcover R2,970 Discovery Miles 29 700
Dual Quaternions and Their Associated…
Ronald Goldman Paperback R1,454 Discovery Miles 14 540
Fibonacci Cubes With Applications And…
Omer Egecioglu, Sandi Klavzar, … Hardcover R2,380 Discovery Miles 23 800
Digital Protection for Power Systems
Salman K. Salman, A.T. Johns Hardcover R3,128 R2,831 Discovery Miles 28 310
Theory and Computation of Tensors…
Yimin Wei, Weiyang Ding Paperback R1,372 Discovery Miles 13 720
Numerical Time-Dependent Partial…
Moysey Brio, Gary M. Webb, … Hardcover R3,033 R2,850 Discovery Miles 28 500
Restricted Congruences in Computing
Khodakhast Bibak Hardcover R1,666 Discovery Miles 16 660
Conceptual Spaces: Elaborations and…
Mauri Kaipainen, Frank Zenker, … Hardcover R3,112 Discovery Miles 31 120
Handbook of Research on Emerging Trends…
Arun Solanki, Sandeep Kumar, … Hardcover R10,356 Discovery Miles 103 560
Numerical Methods for Linear Control…
Biswa Datta Hardcover R2,251 Discovery Miles 22 510
Essential Linear Algebra with…
Titu Andreescu Hardcover R2,882 Discovery Miles 28 820

See more

Partners