An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs (Q4944662)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1420187
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs |
scientific article; zbMATH DE number 1420187 |
Statements
An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs (English)
0 references
23 August 2000
0 references
permutation graph
0 references
0.8868322968482971
0 references
0.8671135306358337
0 references
0.8626254200935364
0 references
0.850684642791748
0 references
