000			01671n a2200313#a 4500
001			35391
003			P5A
005			20221213140523.0
008			130305s2013 riua b 100 0 eng||
010			_a2012048265
020			_a9780821890387 (alk. paper)
020			_a0821890387 (alk. paper)
035			_a(OCoLC)
090			_acolm
111	2		_aDIMACS Implementation Challenge Workshop _n(10th: _d2012: _cAtlanta, Ga.)
245	1	0	_aGraph partitioning and graph clustering: _b10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA/ _cDavid A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner, editors.
300			_axiii, 240 pages: _billustrations; _c26 cm.
490	1		_aContemporary mathematics; _vv. 588
504			_aIncludes bibliographical references.
650	0	0	_aGraph algorithms _vCongresses.
650	0	0	_aGraph theory _vCongresses.
697			_aColeções de Monografias. _923736
700	1		_aBader, David A. _d1969- _eeditor of compilation. _96136
700	1		_aMeyerhenke, Henning _d1978- _eeditor of compilation. _96137
700	1		_aSanders, Peter _eeditor of compilation. _96138
700	1		_aWagner, Dorothea _d1957- _eeditor of compilation. _96139
830		0	_aContemporary mathematics (American Mathematical Society); _vv. 588. _93766
942			_2impa _cBK
999			_aDIMACS IMPLEMENTATION CHALLENGE WORKSHOP, 10th, 2012, Atlanta, Ga.). <b> Graph partitioning and graph clustering: </b> 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA. xiii, 240 pages (Contemporary mathematics ; v. 588). ISBN 9780821890387 (alk. paper). _c34288 _d34288