Geometry, Flows, and Graph-Partitioning Algorithms.
The article discusses graph partitioning within the computing industry, presenting a survey of articles and research on the topic. Graph partitioning concerns itself with vertices of a graph that need to be partitioned into two or more large pieces while at the same time minimizing the number of edg...
| Publicado en: | Communications of the ACM Vol. 51; no. 10; pp. 96 - 106 |
|---|---|
| Autores principales: | , , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Oct2008
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=34540765&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 34540765 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Oct2008 vid: 51 iid: 10 pid: 68 pub: Association for Computing Machinery artinfo: ui: 34540765 10.1145/1400181.1400204 ppf: 96 ppct: 10 formats: tig: atl: Geometry, Flows, and Graph-Partitioning Algorithms. aug: au: Arora, Sanjeev Rao, Satish Vazirani, Umesh affil: Computer Science Department, Princeton University, Princeton, NJ 08544, USA. Computer Science Department, UC, Berkeley, CA 94720, USA. su: Integrated circuit design Algorithm research Computer science Approximation theory Parallel computers Computer programming sug: subj: Integrated circuit design Algorithm research Computer science Approximation theory Parallel computers Computer programming ab: The article discusses graph partitioning within the computing industry, presenting a survey of articles and research on the topic. Graph partitioning concerns itself with vertices of a graph that need to be partitioned into two or more large pieces while at the same time minimizing the number of edges that cross the cut. Topics include the use of divide and cut algorithms, laying out large circuits on silicon chips, and computation distribution among processors. Also discussed is the design of algorithms with the best provable approximation guarantees. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2008 holdings: @attributes: islocal: N |
|---|