Graph partitioning and graph clustering: 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch Tagungsbericht E-Book |
| Sprache: | English |
| Veröffentlicht: |
2013
|
| Schriftenreihe: | Contemporary mathematics
588 |
| Schlagworte: | |
| Online-Zugang: | UBM01 Volltext |
| Beschreibung: | Includes bibliographical references |
| Beschreibung: | 1 Online-Ressource |
| ISBN: | 9780821898697 |
| DOI: | 10.1090/conm/588 |
Internformat
MARC
| LEADER | 00000nmm a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV047444479 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 006 | a |||| 10||| | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 210830s2013 xxu|||| o||u| ||||||eng d | ||
| 020 | |a 9780821898697 |9 978-0-8218-9869-7 | ||
| 024 | 7 | |a 10.1090/conm/588 |2 doi | |
| 035 | |a (OCoLC)1268189233 | ||
| 035 | |a (DE-599)BVBBV047444479 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-19 | ||
| 050 | 0 | |a QA166.245 | |
| 082 | 0 | |a 511/.5 |2 23 | |
| 084 | |a SD 2012 |0 (DE-625)142746: |2 rvk | ||
| 111 | 2 | |a Implementation Challenge Workshop |n 10 |d 2012 |c Atlanta, Ga. |j Verfasser |0 (DE-588)1038774047 |4 aut | |
| 245 | 1 | 0 | |a Graph partitioning and graph clustering |b 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA |c David A. Bader ..., editors |
| 264 | 1 | |c 2013 | |
| 300 | |a 1 Online-Ressource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Contemporary mathematics |v 588 | |
| 500 | |a Includes bibliographical references | ||
| 650 | 4 | |a Graph algorithms |v Congresses | |
| 650 | 4 | |a Graph theory |v Congresses | |
| 650 | 4 | |a Combinatorics ... Graph theory ... Graph algorithms | |
| 650 | 4 | |a Computer science ... Algorithms ... Nonnumerical algorithms | |
| 650 | 4 | |a Combinatorics ... Graph theory ... Small world graphs, complex networks | |
| 650 | 4 | |a Computer science ... Algorithms ... Parallel algorithms | |
| 650 | 4 | |a Computer science ... Discrete mathematics in relation to computer science ... Graph theory (including graph drawing) | |
| 650 | 4 | |a Combinatorics ... Graph theory ... Graphs and linear algebra (matrices, eigenvalues, etc.) | |
| 650 | 4 | |a Combinatorics ... Graph theory ... Hypergraphs | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 700 | 1 | |a Bader, David A. |d 1969- |0 (DE-588)130636584 |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-0-8218-9038-7 |
| 856 | 4 | 0 | |u https://doi.org/10.1090/conm/588 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-138-AMM | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032846589 | ||
| 966 | e | |u https://doi.org/10.1090/conm/588 |l UBM01 |p ZDB-138-AMM |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182737702092800 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author2 | Bader, David A. 1969- |
| author2_role | edt |
| author2_variant | d a b da dab |
| author_GND | (DE-588)130636584 |
| author_corporate | Implementation Challenge Workshop Atlanta, Ga |
| author_corporate_role | aut |
| author_facet | Bader, David A. 1969- Implementation Challenge Workshop Atlanta, Ga |
| author_sort | Implementation Challenge Workshop Atlanta, Ga |
| building | Verbundindex |
| bvnumber | BV047444479 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.245 |
| callnumber-search | QA166.245 |
| callnumber-sort | QA 3166.245 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SD 2012 |
| collection | ZDB-138-AMM |
| ctrlnum | (OCoLC)1268189233 (DE-599)BVBBV047444479 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| doi_str_mv | 10.1090/conm/588 |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02280nmm a2200529 cb4500</leader><controlfield tag="001">BV047444479</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210830s2013 xxu|||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780821898697</subfield><subfield code="9">978-0-8218-9869-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1090/conm/588</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1268189233</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047444479</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166.245</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SD 2012</subfield><subfield code="0">(DE-625)142746:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Implementation Challenge Workshop</subfield><subfield code="n">10</subfield><subfield code="d">2012</subfield><subfield code="c">Atlanta, Ga.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1038774047</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph partitioning and graph clustering</subfield><subfield code="b">10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA</subfield><subfield code="c">David A. Bader ..., editors</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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">Contemporary mathematics</subfield><subfield code="v">588</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph algorithms</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics ... Graph theory ... Graph algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science ... Algorithms ... Nonnumerical algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics ... Graph theory ... Small world graphs, complex networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science ... Algorithms ... Parallel algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science ... Discrete mathematics in relation to computer science ... Graph theory (including graph drawing)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics ... Graph theory ... Graphs and linear algebra (matrices, eigenvalues, etc.)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics ... Graph theory ... Hypergraphs</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bader, David A.</subfield><subfield code="d">1969-</subfield><subfield code="0">(DE-588)130636584</subfield><subfield code="4">edt</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">978-0-8218-9038-7</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1090/conm/588</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-138-AMM</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032846589</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1090/conm/588</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-138-AMM</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV047444479 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T18:01:46Z |
| indexdate | 2024-07-10T09:12:19Z |
| institution | BVB |
| institution_GND | (DE-588)1038774047 |
| isbn | 9780821898697 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032846589 |
| oclc_num | 1268189233 |
| open_access_boolean | |
| owner | DE-19 DE-BY-UBM |
| owner_facet | DE-19 DE-BY-UBM |
| physical | 1 Online-Ressource |
| psigel | ZDB-138-AMM |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| record_format | marc |
| series2 | Contemporary mathematics |
| spelling | Implementation Challenge Workshop 10 2012 Atlanta, Ga. Verfasser (DE-588)1038774047 aut Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA David A. Bader ..., editors 2013 1 Online-Ressource txt rdacontent c rdamedia cr rdacarrier Contemporary mathematics 588 Includes bibliographical references Graph algorithms Congresses Graph theory Congresses Combinatorics ... Graph theory ... Graph algorithms Computer science ... Algorithms ... Nonnumerical algorithms Combinatorics ... Graph theory ... Small world graphs, complex networks Computer science ... Algorithms ... Parallel algorithms Computer science ... Discrete mathematics in relation to computer science ... Graph theory (including graph drawing) Combinatorics ... Graph theory ... Graphs and linear algebra (matrices, eigenvalues, etc.) Combinatorics ... Graph theory ... Hypergraphs (DE-588)1071861417 Konferenzschrift gnd-content Bader, David A. 1969- (DE-588)130636584 edt Erscheint auch als Druck-Ausgabe 978-0-8218-9038-7 https://doi.org/10.1090/conm/588 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA Graph algorithms Congresses Graph theory Congresses Combinatorics ... Graph theory ... Graph algorithms Computer science ... Algorithms ... Nonnumerical algorithms Combinatorics ... Graph theory ... Small world graphs, complex networks Computer science ... Algorithms ... Parallel algorithms Computer science ... Discrete mathematics in relation to computer science ... Graph theory (including graph drawing) Combinatorics ... Graph theory ... Graphs and linear algebra (matrices, eigenvalues, etc.) Combinatorics ... Graph theory ... Hypergraphs |
| subject_GND | (DE-588)1071861417 |
| title | Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA |
| title_auth | Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA |
| title_exact_search | Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA |
| title_exact_search_txtP | Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA |
| title_full | Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA David A. Bader ..., editors |
| title_fullStr | Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA David A. Bader ..., editors |
| title_full_unstemmed | Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA David A. Bader ..., editors |
| title_short | Graph partitioning and graph clustering |
| title_sort | graph partitioning and graph clustering 10th dimacs implementation challenge workshop february 13 14 2012 georgia institute of technology atlanta ga |
| title_sub | 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA |
| topic | Graph algorithms Congresses Graph theory Congresses Combinatorics ... Graph theory ... Graph algorithms Computer science ... Algorithms ... Nonnumerical algorithms Combinatorics ... Graph theory ... Small world graphs, complex networks Computer science ... Algorithms ... Parallel algorithms Computer science ... Discrete mathematics in relation to computer science ... Graph theory (including graph drawing) Combinatorics ... Graph theory ... Graphs and linear algebra (matrices, eigenvalues, etc.) Combinatorics ... Graph theory ... Hypergraphs |
| topic_facet | Graph algorithms Congresses Graph theory Congresses Combinatorics ... Graph theory ... Graph algorithms Computer science ... Algorithms ... Nonnumerical algorithms Combinatorics ... Graph theory ... Small world graphs, complex networks Computer science ... Algorithms ... Parallel algorithms Computer science ... Discrete mathematics in relation to computer science ... Graph theory (including graph drawing) Combinatorics ... Graph theory ... Graphs and linear algebra (matrices, eigenvalues, etc.) Combinatorics ... Graph theory ... Hypergraphs Konferenzschrift |
| url | https://doi.org/10.1090/conm/588 |
| work_keys_str_mv | AT implementationchallengeworkshopatlantaga graphpartitioningandgraphclustering10thdimacsimplementationchallengeworkshopfebruary13142012georgiainstituteoftechnologyatlantaga AT baderdavida graphpartitioningandgraphclustering10thdimacsimplementationchallengeworkshopfebruary13142012georgiainstituteoftechnologyatlantaga |