Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967)
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: Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph |
scientific article; zbMATH DE number 861037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph |
scientific article; zbMATH DE number 861037 |
Statements
Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (English)
0 references
8 April 1996
0 references
parallel algorithms
0 references
0.9022349
0 references
0.90063727
0 references
0.89985645
0 references
0.8987058
0 references
0 references
0.89316213
0 references
0.89101964
0 references
