Graph Separators, with Applications

Name: Graph Separators, with Applications
SKU: 2818431
Price: 278.99 AUD
Availability: InStock

By:

Format:

Hardback

Series:

Frontiers in Computer Science

Show Hide Adult Content

$278.99

RRP:: ~~$302.95~~ save $23.96

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Buy Now, Pay Later with:

4 payments of $69.75 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

Around 4-16 July using International Courier

Description

This text 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 its main focus is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects the 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.

Release date Australia

June 30th, 2001

Author

Audiences

Postgraduate, Research & Scholarly
Professional & Vocational

Illustrations

XII, 257 p.

Pages

257

Series

Frontiers in Computer Science

Dimensions

155x235x23

ISBN-13

9780306464645

Product ID

2818431

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here