Graph Separators, with Applications
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...
| Main Authors: | Rosenberg, Arnold L. (Author), Heath, Lenwood S. (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Boston, MA :
Springer US,
2002.
|
| Series: | Frontiers of Computer Science
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Combinatorial Optimization and Graph Algorithms Communications of NII Shonan Meetings /
Published: (2017) -
Basic Graph Theory
by: Rahman, Md. Saidur
Published: (2017) -
Extremal Combinatorics With Applications in Computer Science /
by: Jukna, Stasys
Published: (2011) -
Fundamentals of Computation Theory 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings /
Published: (2013) -
Teoria degli Automi Finiti
by: Luca, Aldo de, et al.
Published: (2013)