A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs (Q4210419): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q30051063, #quickstatements; #temporary_batch_1711196317277 |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MESHPART / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Chaco / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q30051063 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:23, 23 March 2024
scientific article; zbMATH DE number 1201033
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs |
scientific article; zbMATH DE number 1201033 |
Statements
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs (English)
0 references
21 September 1998
0 references
graph partitioning
0 references
parallel computations
0 references
fill-reducing orderings
0 references
finite element computations
0 references
