"Fast and effective algorithms for graph partitioning and sparse-matrix ..."

Anshul Gupta (1997)

> Home

Details and statistics

DOI: 10.1147/RD.411.0171

access: closed

type: Journal Article

metadata version: 2020-03-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ibmrd/Gupta97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ibmrd/Gupta97
Anshul Gupta:
Fast and effective algorithms for graph partitioning and sparse-matrix ordering. IBM J. Res. Dev. 41(1&2): 171-184 (1997)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.