An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs (Q4944662): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207169908804868 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093063644 / rank | |||
Normal rank | |||
Revision as of 19:56, 19 March 2024
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
