Finding nonoverlapping substructures of a sparse matrix.
Pinar, Ali; Vassilevska, Virginia
ETNA. Electronic Transactions on Numerical Analysis [electronic only] (2005)
- Volume: 21, page 107-124
- ISSN: 1068-9613
Access Full Article
top
How to cite
topPinar, Ali, and Vassilevska, Virginia. "Finding nonoverlapping substructures of a sparse matrix.." ETNA. Electronic Transactions on Numerical Analysis [electronic only] 21 (2005): 107-124. <http://eudml.org/doc/128025>.
@article{Pinar2005,
author = {Pinar, Ali, Vassilevska, Virginia},
journal = {ETNA. Electronic Transactions on Numerical Analysis [electronic only]},
keywords = {memory performance; memory-efficient date structures; high-performance computing; sparse matrices; independent sets; NT-completeness; approximation algorithms},
language = {eng},
pages = {107-124},
publisher = {Kent State University, Department of Mathematics and Computer Science},
title = {Finding nonoverlapping substructures of a sparse matrix.},
url = {http://eudml.org/doc/128025},
volume = {21},
year = {2005},
}
TY - JOUR
AU - Pinar, Ali
AU - Vassilevska, Virginia
TI - Finding nonoverlapping substructures of a sparse matrix.
JO - ETNA. Electronic Transactions on Numerical Analysis [electronic only]
PY - 2005
PB - Kent State University, Department of Mathematics and Computer Science
VL - 21
SP - 107
EP - 124
LA - eng
KW - memory performance; memory-efficient date structures; high-performance computing; sparse matrices; independent sets; NT-completeness; approximation algorithms
UR - http://eudml.org/doc/128025
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.