2026-10-03T17:00:30Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2091 2024-03-06T10:08:34Z ddc:004 open_access

Distillating knowledge about SCOTCH Pellegrini, Francois Scotch graph algorithms data structures The design of the Scotch library for static mapping, graph partitioning and sparse matrix ordering is highly modular, so as to allow users and potential contributors to tweak it and add easily new static mapping, graph bipartitioning, vertex separation or graph ordering methods to match their particular needs. The purpose of this tutorial is twofold. It will start with a description of the interface of Scotch, presenting its visible objects and data structures. Then, we will step into the API mirror and have a look at the inside: the internal representation of graphs, mappings and orderings, and the basic sequential and parallel building blocks: graph induction, graph coarsening which can be re-used by third-party software. As an example, we will show how to add a simple genetic algorithm routine to the graph bipartitioning methods. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Francois Pellegrini 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9061, Combinatorial Scientific Computing (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09061.9 urn:nbn:de:0030-drops-20914 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.9 eng https://creativecommons.org/licenses/by/4.0/legalcode