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...
Κύριοι συγγραφείς: | Rosenberg, Arnold L. (Συγγραφέας), Heath, Lenwood S. (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Boston, MA :
Springer US,
2002.
|
Σειρά: | Frontiers of Computer Science
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Combinatorial Optimization and Graph Algorithms Communications of NII Shonan Meetings /
Έκδοση: (2017) -
Basic Graph Theory
ανά: Rahman, Md. Saidur
Έκδοση: (2017) -
Extremal Combinatorics With Applications in Computer Science /
ανά: Jukna, Stasys
Έκδοση: (2011) -
Fundamentals of Computation Theory 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings /
Έκδοση: (2013) -
Teoria degli Automi Finiti
ανά: Luca, Aldo de, κ.ά.
Έκδοση: (2013)