Back to Results
First PageMeta Content
NP-complete problems / Shortest path problem / Tree / Graph / Graph theory / Theoretical computer science / Mathematics


Scotch and libScotch 4.0 User’s Guide∗ Fran¸cois Pellegrini ScAlApplix project, INRIA Futurs ENSEIRB & LaBRI, UMR CNRS 5800 Universit´e Bordeaux I 351 cours de la Lib´eration, 33405 TALENCE, FRANCE
Add to Reading List

Document Date: 2007-08-08 05:02:28


Open Document

File Size: 800,28 KB

Share Result on Facebook

City

TALENCE / /

Company

Vertex / /

Country

France / /

Currency

pence / /

/

IndustryTerm

interconnection network / software library / communication network / libre software / nearby processors / software package / graph bipartitioning algorithm / graph bipartitioning algorithms / iterative algorithms / sparse linear systems / scientific computing / greedy algorithm / sub-optimal solutions / nested dissection ordering algorithm / /

OperatingSystem

GNU / /

Position

author / storeand-forward / research scientist / GNU Lesser General Public License / /

ProgrammingLanguage

Fortran / /

Technology

greedy algorithm / graph bipartitioning algorithm / hypergraph partitioning algorithms / 1.3 The Dual Recursive Bipartitioning algorithm / mapping algorithm / one processor / 3 3.1 Algorithms / 2.2 Halo Approximate Minimum Fill algorithm / 7 7 7 3 Algorithms / nested dissection ordering algorithm / Hybridization / graph bipartitioning algorithms / corresponding processor / /

SocialTag