The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs (Q2731130)
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: The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs |
scientific article; zbMATH DE number 1625575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs |
scientific article; zbMATH DE number 1625575 |
Statements
28 October 2001
0 references
hinge vertices
0 references
interval graph
0 references
The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs (English)
0 references
0.8428360819816589
0 references
0.8340297937393188
0 references
0.8005462288856506
0 references
0.7620350122451782
0 references
