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.
- ISBN:
- 9780306464645
- 9780306464645
-
Category:
- Algorithms & data structures
- Format:
- Hardback
- Publication Date:
-
30-06-2001
- Publisher:
- Springer Science+Business Media
- Country of origin:
- United States
- Pages:
- 257
- Dimensions (mm):
- 235x155x23mm
- Weight:
- 1.23kg
This title is in stock with our Australian supplier and should arrive at our Sydney warehouse within 2 - 3 weeks of you placing an order.
Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.
Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:
ACT Metro 2 working days
NSW Metro 2 working days
NSW Rural 2 - 3 working days
NSW Remote 2 - 5 working days
NT Metro 3 - 6 working days
NT Remote 4 - 10 working days
QLD Metro 2 - 4 working days
QLD Rural 2 - 5 working days
QLD Remote 2 - 7 working days
SA Metro 2 - 5 working days
SA Rural 3 - 6 working days
SA Remote 3 - 7 working days
TAS Metro 3 - 6 working days
TAS Rural 3 - 6 working days
VIC Metro 2 - 3 working days
VIC Rural 2 - 4 working days
VIC Remote 2 - 5 working days
WA Metro 3 - 6 working days
WA Rural 4 - 8 working days
WA Remote 4 - 12 working days
Share This Book: