Parallel graph algorithms for finding weighted matchings and subgraphs in computational science (Q2830821)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel graph algorithms for finding weighted matchings and subgraphs in computational science |
scientific article; zbMATH DE number 6645961
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel graph algorithms for finding weighted matchings and subgraphs in computational science |
scientific article; zbMATH DE number 6645961 |
Statements
31 October 2016
0 references
0.94284964
0 references
0.9149239
0 references
0.9124118
0 references
0.91082835
0 references
0.9098775
0 references
Parallel graph algorithms for finding weighted matchings and subgraphs in computational science (English)
0 references