Devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators - upper bounds being obtained via decomposition algorithms. This book surveys the main approaches to obtaining good graph separations. It focuses on techniques for deriving lower bounds on the sizes of graph separators.
Loading similar products...
Stay informed about the best deals and price drops. Choose which notifications you'd like to receive from PriceCheck.
Free easy-to-follow course for anyone in South Africa who wants to learn how to start a digital business.