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
LEADER 02932nam a22005175i 4500
001 978-0-306-46977-0
003 DE-He213
005 20151030061447.0
007 cr nn 008mamaa
008 100301s2002 xxu| s |||| 0|eng d
020 |a 9780306469770  |9 978-0-306-46977-0 
024 7 |a 10.1007/b115747  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UY  |2 bicssc 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a COM031000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
100 1 |a Rosenberg, Arnold L.  |e author. 
245 1 0 |a Graph Separators, with Applications  |h [electronic resource] /  |c by Arnold L. Rosenberg, Lenwood S. Heath. 
264 1 |a Boston, MA :  |b Springer US,  |c 2002. 
300 |a XII, 257 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Frontiers of Computer Science 
505 0 |a A Technical Introduction -- Applications of Graph Separators -- Upper-Bound Techniques -- Lower-Bound Techniques. 
520 |a 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 on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects our 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. Given the multitude of notions of graph separator that have been developed and studied over the past (roughly) three decades, there is a need for a central, theory-oriented repository for the mass of results. The need is absolutely critical in the area of lower-bound techniques for graph separators, since these techniques have virtually never appeared in articles having the word `separator' or any of its near-synonyms in the title. Graph Separators with Applications fills this need. 
650 0 |a Computer science. 
650 0 |a Computers. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Mathematics of Computing. 
700 1 |a Heath, Lenwood S.  |e author. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9780306464645 
830 0 |a Frontiers of Computer Science 
856 4 0 |u http://dx.doi.org/10.1007/b115747  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)