Tools

LEADER 02970nam a2200577 i 4500

001 ssj0001034522;

003 WaSeSS;

005 20210713080458.0;

006 m d ;

007 cr n ;

008 130305s2013 riua sb 100 0 eng d;

010 a| 2012048265;

020 a| 9780821890387 (alk. paper);

035 a| (WaSeSS)ssj0001034522;

040 a| DLCb| engc| DLCd| WaSeSS;

042 a| pcc;

049 a| EREEa| NEHH;

050 00 a| QA166.245b| .D56 2013;

082 00 a| 511/.52| 23;

084 a| 05C85a| 68W05a| 05C82a| 68W10a| 68R10a| 05C50a| 05C652| msc;

111 2 a| DIMACS Implementation Challenge Workshopn| (10th :d| 2012 :c| Atlanta, Ga.)?| UNAUTHORIZED;

245 10 a| Graph partitioning and graph clusteringh| [electronic resource] :b| 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA /c| David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner, editors.;

260 a| Providence, Rhode Island :b| American Mathematical Society,c| [2013];

300 a| xiii, 240 pages :b| illustrations ;c| 26 cm.;

490 0 a| Contemporary mathematics ;v| volume 588;

504 a| Includes bibliographical references.;

506 a| Available only to authorized users.;

538 a| Mode of access: World Wide Web;

650 0 a| Graph algorithmsv| Congresses.=| ^A533126;

650 0 a| Graph theoryv| Congresses.=| ^A25972;

650 7 a| Combinatorics -- Graph theory -- Graph algorithms.2| msc;

650 7 a| Computer science -- Algorithms -- Nonnumerical algorithms.2| msc;

650 7 a| Combinatorics -- Graph theory -- Small world graphs, complex networks.2| msc;

650 7 a| Computer science -- Algorithms -- Parallel algorithms.2| msc;

650 7 a| Computer science -- Discrete mathematics in relation to computer science -- Graph theory (including graph drawing).2| msc;

650 7 a| Combinatorics -- Graph theory -- Graphs and linear algebra (matrices, eigenvalues, etc.).2| msc;

650 7 a| Combinatorics -- Graph theory -- Hypergraphs.2| msc;

655 0 a| Electronic books.=| ^A491897;

700 1 a| Bader, David A.,d| 1969-=| ^A653667;

700 1 a| Meyerhenke, Henning,d| 1978-?| UNAUTHORIZED;

700 1 a| Sanders, Peter.?| UNAUTHORIZED;

700 1 a| Wagner, Dorothea,d| 1957-=| ^A474113;

856 40 z| Full text available from Ebook Central - Academic Completeu| https://ebookcentral.proquest.com/lib/eastcarolina/detail.action?docID=3113242;

949 a| CLICK ON WEB ADDRESSw| ASISh| JOYNER188;

949 a| CLICK ON WEB ADDRESSw| ASISh| HSL77;

949 a| CLICK ON WEB ADDRESSw| ASISh| JMUSIC60;

596 a| 1 3 4;

998 a| 5647252;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 5647252-1001l| JNETm| JOYNERr| Ys| Yt| JNESSBKu| 7/20/2021x| EBOOKz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 5647252-2001l| HSLELECm| HSLr| Ys| Yt| HEBKu| 7/20/2021x| EBOOKz| HERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 5647252-3001l| MNETm| JMUSICr| Ys| Yt| MNESSBKu| 7/20/2021x| EBOOKz| JERESOURCE;

Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA / David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner, editors.

Author/creator	DIMACS Implementation Challenge Workshop
Format	Electronic
Publication Info	Providence, Rhode Island : American Mathematical Society, [2013]
Description	xiii, 240 pages : illustrations ; 26 cm.
Supplemental Content	Full text available from Ebook Central - Academic Complete
Subjects	Graph algorithms--Congresses. Graph theory--Congresses.

Other author/creator	Bader, David A., 1969-
Other author/creator	Meyerhenke, Henning, 1978-
Other author/creator	Sanders, Peter.
Other author/creator	Wagner, Dorothea, 1957-
Series	Contemporary mathematics ; volume 588
Bibliography note	Includes bibliographical references.
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	2012048265
ISBN	9780821890387 (alk. paper)

Availability

Library	Location	Call Number	Status	Item Actions
	Electronic Resources	Access Content Online	✔ Available

Graph partitioning and graph clustering 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA / David A. Bader, Henning Meyerhenke, Peter Sanders, Dorothea Wagner, editors.

Click here for more information about this title

Availability