Graph partitioning and graph clustering are ubiquitous subtasks in many applications where graphs play an important role. Generally speaking, both techniques aim at the identification of vertex subsets with many internal and few external edges. To name only a few, problems addressed by graph partitioning and graph clustering algorithms are:
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
David A. Bader, Georgia Institute of Technology, Atlanta, GA, USA.
Henning Meyerhenke, Karlsruhe Institute of Technology, Germany.
Peter Sanders, Karlsruhe Institute of Technology, Germany.
Dorothea Wagner, Karlsruhe Institute of Technology, Germany.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Etat : Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. N° de réf. du vendeur Z1-F-020-02521
Quantité disponible : 1 disponible(s)