Parallel algorithms for connectivity problems on interval graphs (Q1350233)
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 983946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms for connectivity problems on interval graphs |
scientific article; zbMATH DE number 983946 |
Statements
Parallel algorithms for connectivity problems on interval graphs (English)
0 references
27 February 1997
0 references
Parallel algorithms
0 references
Interval graph
0 references
Biconnected components
0 references
Connected components
0 references
0 references
0 references
0.8628810048103333
0 references
0.8548292517662048
0 references
0.8458670973777771
0 references
0.8382917642593384
0 references
0.8370488286018372
0 references
