An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Seunghwa Kang, David A. Bader
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
PPoPP, 2009.

PPoPP 2009
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{PPoPP-2009-KangB,
	author        = "Seunghwa Kang and David A. Bader",
	booktitle     = "{Proceedings of the 14th Symposium on Principles and Practice of Parallel Programming}",
	doi           = "10.1145/1504176.1504182",
	isbn          = "978-1-60558-397-6",
	pages         = "15--24",
	publisher     = "{ACM}",
	title         = "{An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs}",
	year          = 2009,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.