Optimal parallel algorithms for finding cut vertices and bridges of interval graphs (Q1198065)
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 92122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal parallel algorithms for finding cut vertices and bridges of interval graphs |
scientific article; zbMATH DE number 92122 |
Statements
Optimal parallel algorithms for finding cut vertices and bridges of interval graphs (English)
0 references
16 January 1993
0 references
cut vertices
0 references
bridges
0 references
blocks
0 references
interval graph
0 references
parallel prefix algorithm
0 references
0.9517850875854492
0 references
0.8692180514335632
0 references
0.8628810048103333
0 references
0.850684642791748
0 references
