Technical Perspective: New Developments in Graph Partitioning.

The article discusses developments in graph partitioning, presenting a review of another article in the issue that surveys developments in approximation algorithms from 1998 to 2008. The author states that graph partitioning played a role in research about algorithms and algorithmic techniques. Topi...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 51; no. 10; pp. 95 - 96
Autor principal: Tardos, Éva
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=34540764&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 34540764
    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:
        34540764
        10.1145/1400181.1400203
      ppf: 95
      ppct: 1
      formats:
      tig:
        atl: Technical Perspective: New Developments in Graph Partitioning.
      aug:
        au: Tardos, Éva
        affil: Chair of Professor, Department of Computer Science, Cornell University, Ithaca, NY.
      su:
        Algorithm research
        Approximation theory
        Surveys
        Parallel computers
        Distributed computing
        Computer architecture
      sug:
        subj:
          Algorithm research
          Approximation theory
          Surveys
          Parallel computers
          Distributed computing
          Computer architecture
      ab: The article discusses developments in graph partitioning, presenting a review of another article in the issue that surveys developments in approximation algorithms from 1998 to 2008. The author states that graph partitioning played a role in research about algorithms and algorithmic techniques. Topics include packetrouting in distributed networks, parallel computing architectures and algorithms, and finding an optimal balanced partition. Also discussed are algorithms based on semidefinite programming.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2008
    holdings:
      @attributes:
        islocal: N