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: R3,013
Discovery Miles 30 130
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 R3,013 Discovery Miles 30 130 | Repayment Terms: R282 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 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..

Discrete and Combinatorial Mathematics…
Ralph Grimaldi Paperback R2,537 Discovery Miles 25 370
Forbidden Configurations in Discrete…
David Eppstein Hardcover R2,925 Discovery Miles 29 250
Machine Learning with Quantum Computers
Maria Schuld, Francesco Petruccione Hardcover R3,839 Discovery Miles 38 390
Modeling and Simulating Complex Business…
Zoumpolia Dikopoulou Hardcover R3,794 Discovery Miles 37 940
Numerical Geometry, Grid Generation and…
Vladimir A. Garanzha, Lennard Kamenski, … Hardcover R6,719 Discovery Miles 67 190
Techniques for Searching, Parsing, and…
Alberto Pettorossi Hardcover R2,833 Discovery Miles 28 330
Probability in Electrical Engineering…
Jean Walrand Hardcover R1,664 Discovery Miles 16 640
Fundamentals of Logic and Computation…
Zhe Hou Hardcover R996 Discovery Miles 9 960
Advanced Topics in Bisimulation and…
Davide Sangiorgi, Jan Rutten Hardcover R2,858 Discovery Miles 28 580
Schwarz Methods and Multilevel…
Ernst P. Stephan, Thanh Tran Hardcover R5,065 Discovery Miles 50 650
Hajnal Andreka and Istvan Nemeti on…
Judit Madarasz, Gergely Szekely Hardcover R3,123 Discovery Miles 31 230
Logic and Implication - An Introduction…
Petr Cintula, Carles Noguera Hardcover R3,629 Discovery Miles 36 290

See more

Partners