Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA
Graph partitioning and graph clustering are ubiquitous subtasks in many applications where graphs play an important role. Generally speaking, both techniques aim at the identification of vertex subsets with many internal and few external edges. To name only a few, problems addressed by graph partiti...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | E-kniha Kniha |
| Jazyk: | angličtina |
| Vydáno: |
Providence, R.I
American Mathematical Society
2013
|
| Edice: | Contemporary mathematics |
| Témata: | |
| ISBN: | 9780821890387, 0821890387 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Graph partitioning and graph clustering are ubiquitous subtasks in many applications where graphs play an important role. Generally speaking, both techniques aim at the identification of vertex subsets with many internal and few external edges. To name only a few, problems addressed by graph partitioning and graph clustering algorithms are: li>What are the communities within an (online) social network? How do I speed up a numerical simulation by mapping it efficiently onto a parallel computer? How must components be organised on a computer chip such that they can communicate efficiently with each other? What are the segments of a digital image? Which functions are certain genes (most likely) responsible for? The 10th DIMACS Implementation Challenge Workshop was devoted to determining realistic performance of algorithms where worst case analysis is overly pessimistic and probabilistic models are too unrealistic. Articles in the volume describe and analyse various experimental data with the goal of getting insight into realistic algorithm performance in situations where analysis fails. This book is published in cooperation with the Center for Discrete Mathematics and Theoretical Computer Science. |
|---|---|
| AbstractList | Graph partitioning and graph clustering are ubiquitous subtasks in many applications where graphs play an important role. Generally speaking, both techniques aim at the identification of vertex subsets with many internal and few external edges. To name only a few, problems addressed by graph partitioning and graph clustering algorithms are: li>What are the communities within an (online) social network? How do I speed up a numerical simulation by mapping it efficiently onto a parallel computer? How must components be organised on a computer chip such that they can communicate efficiently with each other? What are the segments of a digital image? Which functions are certain genes (most likely) responsible for? The 10th DIMACS Implementation Challenge Workshop was devoted to determining realistic performance of algorithms where worst case analysis is overly pessimistic and probabilistic models are too unrealistic. Articles in the volume describe and analyse various experimental data with the goal of getting insight into realistic algorithm performance in situations where analysis fails. This book is published in cooperation with the Center for Discrete Mathematics and Theoretical Computer Science. |
| Author | Bader, David A. DIMACS Implementation Challenge Workshop |
| Author_xml | – sequence: 1 fullname: DIMACS Implementation Challenge Workshop – sequence: 2 fullname: Bader, David A. |
| BackLink | https://cir.nii.ac.jp/crid/1130282270699052288$$DView record in CiNii |
| BookMark | eNpVUMtOwzAQNIJK0NJ_8IELUiP5kcQ2tyjQEqmIAxUcK8dxHtS1ozgF9Vv4WRLKAS672tHszGim4MI6q8_AXDCOOMFc8Fiw8z83opxNwJQgTFDISRxdgrn37wghjGgYEXIFvladbGvYyq5v-sbZxlZQ2gJWP7AyB9_rbgTvIEZ9De-zpyR9gdm-NXqvbS_HJ5jW0hhtKw3fXLfztWsXcKnz7iC7I8Q0wOECjikWcKVdVzUSZtYPhodeQ1fCjVa1dcZVxwVMeiMH2YGZXINJKY3X8989A6_Lh036GKyfV1marANJophHgSgoVQXiDEkmeMGxCDmnihYxLbXIaRgyhqNYDf1EJI9IGQmNlSxYjggJQ0Vn4PYkLP1Ofw7xTe-3H0bnzu389l-9A_fmxLVNs1XNODGmiHBCGIqFQEOtg_s31Fh1Aw |
| ContentType | eBook Book |
| DBID | RYH |
| DEWEY | 511.5 |
| DatabaseName | CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISBN | 9780821898697 0821898698 |
| ExternalDocumentID | 9780821898697 BB12227048 |
| GroupedDBID | 38. AABBV AAWPO ABARN ABQPQ ACLGV ADVEM AEKGI AERYV AFOJC AHWGJ AJFER ALMA_UNASSIGNED_HOLDINGS AZZ BBABE BNEGX CZZ GEOUK RYH S5T |
| ID | FETCH-LOGICAL-a25685-9d33cd0870a798d8194883c3d63fe9b34477156c98652b52f59e1cad7b02244c3 |
| ISBN | 9780821890387 0821890387 |
| IngestDate | Fri Nov 08 05:34:54 EST 2024 Thu Jun 26 22:54:19 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCN | 2012048265 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a25685-9d33cd0870a798d8194883c3d63fe9b34477156c98652b52f59e1cad7b02244c3 |
| Notes | Includes bibliographical references Center for Discrete Mathematics and Theoretical Computer Science |
| PageCount | 239 |
| ParticipantIDs | askewsholts_vlebooks_9780821898697 nii_cinii_1130282270699052288 |
| PublicationCentury | 2000 |
| PublicationDate | c2013 2013-07-30 |
| PublicationDateYYYYMMDD | 2013-01-01 2013-07-30 |
| PublicationDate_xml | – year: 2013 text: c2013 |
| PublicationDecade | 2010 |
| PublicationPlace | Providence, R.I |
| PublicationPlace_xml | – name: Providence, R.I |
| PublicationSeriesTitle | Contemporary mathematics |
| PublicationYear | 2013 |
| Publisher | American Mathematical Society |
| Publisher_xml | – name: American Mathematical Society |
| SSID | ssj0001034522 |
| Score | 1.9990252 |
| Snippet | Graph partitioning and graph clustering are ubiquitous subtasks in many applications where graphs play an important role. Generally speaking, both techniques... |
| SourceID | askewsholts nii |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Combinatorics -- Graph theory -- Graph algorithms. msc Combinatorics -- Graph theory -- Graphs and linear algebra (matrices, eigenvalues, etc.). msc Combinatorics -- Graph theory -- Hypergraphs. msc Combinatorics -- Graph theory -- Small world graphs, complex networks. msc Computer science -- Algorithms -- Nonnumerical algorithms. msc Computer science -- Algorithms -- Parallel algorithms. msc Computer science -- Discrete mathematics in relation to computer science -- Graph theory (including graph drawing). msc Graph algorithms Graph algorithms -- Congresses Graph theory Graph theory -- Congresses |
| Title | Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA |
| URI | https://cir.nii.ac.jp/crid/1130282270699052288 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9780821898697&uid=none |
| Volume | 588 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLZY4UBPMEBsY-hp4tYGNbWT2Ny6sR8IMZAYaLfKdhwtoqTTkk77X_hnec9NnZbL4MDFatw2qd73ar_32f4eY29koWMuUh6l-UhEouAmUs6JyFhjEo0ulGnpi01k5-fy8lJ9acvc1b6cQFZV8u5OXf9XqLEPwaajs_8Ad7gpduBrBB1bhB3bPyLicNnK95P29OCafGHFshIr7iWpB3a2IEkETwwQCTBqrgbvP3yaHH1dCgT_bM8gVbQAvyyv4on0-mruK9idYO68oB12MY9iQT04p48Dq17qzW0HHWPvB59mhgD6MPU0eMzfPr3jWvOle_lt-IPJ23XCgopHbBAW3UpU0KUl3ZN5ED4J2S1GJ7FUtL7eTVZhC-HhYUzHeHEA2mJbmDP12MPT48_fPnYE24iTWrzX_Fzdp1VcCtd91tf1D5xNcKZpagwvqrJcCy8unrAeHTl5yh64apv1u19cP2O_PKqwjiogquBRhQ5VeAeEKSytCptWhWBVWFl1CCtEwSM6BMJzCC2aENCEeQEdmkNoscRPTp6z7yfHF0dnUVtQI9IY2cokUjnnNh_hGK0zJXOMBnH85pbnKS-cMqT-mGFCb5VMk7FJxkWiXGx1nhkK9YTlL1ivmlfuJQNjhFSFxnQV_-tEI45Fbp1w-A2hFU922MGaaae3M7_4X0-D_WWqsh22jxaf2pLamNbQJWGaYoiE0Em5e8_7e-xx52GvWK-5Wbh99sjeNmV987r1iN8-rWQU |
| linkProvider | ProQuest Ebooks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Graph+partitioning+and+graph+clustering+%3A+10th+DIMACS+Implementation+Challenge+Workshop%2C+February+13-14%2C+2012%2C+Georgia+Institute+of+Technology%2C+Atlanta%2C+GA&rft.au=DIMACS+Implementation+Challenge+Workshop&rft.au=Bader%2C+David+A.&rft.date=2013-01-01&rft.pub=American+Mathematical+Society&rft.isbn=9780821890387&rft.externalDocID=BB12227048 |
| thumbnail_m | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97808218%2F9780821898697.jpg |