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 this page instead for the normal view: An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs |
scientific article; zbMATH DE number 1420187
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
