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...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer US
2002
|
| Ausgabe: | 1st ed. 2002 |
| Schriftenreihe: | Frontiers in Computer Science
|
| Schlagworte: | |
| Online-Zugang: | UBY01 URL des Eerstveröffentlichers |
| Zusammenfassung: | 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 |
| Beschreibung: | 1 Online-Ressource (XII, 257 p) |
| ISBN: | 9780306469770 |
| DOI: | 10.1007/b115747 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064453 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2002 |||| o||u| ||||||eng d | ||
| 020 | |a 9780306469770 |9 978-0-306-46977-0 | ||
| 024 | 7 | |a 10.1007/b115747 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-0-306-46977-0 | ||
| 035 | |a (OCoLC)1227478346 | ||
| 035 | |a (DE-599)BVBBV047064453 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Rosenberg, Arnold L. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Graph Separators, with Applications |c by Arnold L. Rosenberg, Lenwood S. Heath |
| 250 | |a 1st ed. 2002 | ||
| 264 | 1 | |a New York, NY |b Springer US |c 2002 | |
| 300 | |a 1 Online-Ressource (XII, 257 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Frontiers in Computer Science | |
| 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 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Mathematics of Computing | |
| 650 | 4 | |a Computers | |
| 650 | 4 | |a Computer science—Mathematics | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Dekomposition |0 (DE-588)4149030-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | 1 | |a Dekomposition |0 (DE-588)4149030-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Heath, Lenwood S. |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781475787641 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780306464645 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781475787634 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/b115747 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471564 | ||
| 966 | e | |u https://doi.org/10.1007/b115747 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182062486257664 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Rosenberg, Arnold L. Heath, Lenwood S. |
| author_facet | Rosenberg, Arnold L. Heath, Lenwood S. |
| author_role | aut aut |
| author_sort | Rosenberg, Arnold L. |
| author_variant | a l r al alr l s h ls lsh |
| building | Verbundindex |
| bvnumber | BV047064453 |
| classification_rvk | SK 890 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-0-306-46977-0 (OCoLC)1227478346 (DE-599)BVBBV047064453 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| doi_str_mv | 10.1007/b115747 |
| edition | 1st ed. 2002 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03124nmm a2200553zc 4500</leader><controlfield tag="001">BV047064453</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2002 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780306469770</subfield><subfield code="9">978-0-306-46977-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/b115747</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-0-306-46977-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227478346</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064453</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rosenberg, Arnold L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph Separators, with Applications</subfield><subfield code="c">by Arnold L. Rosenberg, Lenwood S. Heath</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2002</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer US</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 257 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Frontiers in Computer Science</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science—Mathematics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Heath, Lenwood S.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781475787641</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780306464645</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781475787634</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/b115747</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471564</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/b115747</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064453 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:22Z |
| indexdate | 2024-07-10T09:01:35Z |
| institution | BVB |
| isbn | 9780306469770 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471564 |
| oclc_num | 1227478346 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (XII, 257 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | Springer US |
| record_format | marc |
| series2 | Frontiers in Computer Science |
| spelling | Rosenberg, Arnold L. Verfasser aut Graph Separators, with Applications by Arnold L. Rosenberg, Lenwood S. Heath 1st ed. 2002 New York, NY Springer US 2002 1 Online-Ressource (XII, 257 p) txt rdacontent c rdamedia cr rdacarrier Frontiers in Computer Science 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 Theory of Computation Discrete Mathematics in Computer Science Mathematics of Computing Computers Computer science—Mathematics Graph (DE-588)4021842-9 gnd rswk-swf Dekomposition (DE-588)4149030-7 gnd rswk-swf Graph (DE-588)4021842-9 s Dekomposition (DE-588)4149030-7 s DE-604 Heath, Lenwood S. aut Erscheint auch als Druck-Ausgabe 9781475787641 Erscheint auch als Druck-Ausgabe 9780306464645 Erscheint auch als Druck-Ausgabe 9781475787634 https://doi.org/10.1007/b115747 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Rosenberg, Arnold L. Heath, Lenwood S. Graph Separators, with Applications Theory of Computation Discrete Mathematics in Computer Science Mathematics of Computing Computers Computer science—Mathematics Graph (DE-588)4021842-9 gnd Dekomposition (DE-588)4149030-7 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4149030-7 |
| title | Graph Separators, with Applications |
| title_auth | Graph Separators, with Applications |
| title_exact_search | Graph Separators, with Applications |
| title_exact_search_txtP | Graph Separators, with Applications |
| title_full | Graph Separators, with Applications by Arnold L. Rosenberg, Lenwood S. Heath |
| title_fullStr | Graph Separators, with Applications by Arnold L. Rosenberg, Lenwood S. Heath |
| title_full_unstemmed | Graph Separators, with Applications by Arnold L. Rosenberg, Lenwood S. Heath |
| title_short | Graph Separators, with Applications |
| title_sort | graph separators with applications |
| topic | Theory of Computation Discrete Mathematics in Computer Science Mathematics of Computing Computers Computer science—Mathematics Graph (DE-588)4021842-9 gnd Dekomposition (DE-588)4149030-7 gnd |
| topic_facet | Theory of Computation Discrete Mathematics in Computer Science Mathematics of Computing Computers Computer science—Mathematics Graph Dekomposition |
| url | https://doi.org/10.1007/b115747 |
| work_keys_str_mv | AT rosenbergarnoldl graphseparatorswithapplications AT heathlenwoods graphseparatorswithapplications |