Every Graph Is Essentially Sparse.
An introduction is presented to the article "Spectral Sparsification of Graphs: Theory and Algorithms," by Joshua Batson, Daniel A. Spielman, Nikhil Srivastava, and Shang-Hua Teng, about the spectral similarity of weighted graphs to sparse graphs in computer science.
| Publicado en: | Communications of the ACM Vol. 56; no. 8; pp. 86 - 87 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Aug2013
|
| 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=89595601&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 89595601 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Aug2013 vid: 56 iid: 8 pid: 68 pub: Association for Computing Machinery artinfo: ui: 89595601 10.1145/2492007.2492028 ppf: 86 ppct: 1 formats: tig: atl: Every Graph Is Essentially Sparse. aug: au: Naor, Assaf affil: Professor of mathematics in the Courant Institute of Mathematical Sciences at New York University. su: Sparse graphs Computer science research sug: subj: Sparse graphs Computer science research ab: An introduction is presented to the article "Spectral Sparsification of Graphs: Theory and Algorithms," by Joshua Batson, Daniel A. Spielman, Nikhil Srivastava, and Shang-Hua Teng, about the spectral similarity of weighted graphs to sparse graphs in computer science. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2013 holdings: @attributes: islocal: N |
|---|