An optimal parallel algorithm to compute all cutvertices and blocks on permutation graphs (Q4944662): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126245991, #quickstatements; #temporary_batch_1722291251637 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126245991 / rank | |||
Normal rank | |||
Latest revision as of 13:02, 30 July 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
