Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564)
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: Recognizing and representing proper interval graphs in parallel using merging and sorting |
scientific article; zbMATH DE number 5131573
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing and representing proper interval graphs in parallel using merging and sorting |
scientific article; zbMATH DE number 5131573 |
Statements
Recognizing and representing proper interval graphs in parallel using merging and sorting (English)
0 references
8 March 2007
0 references
proper interval graph
0 references
parallel sorting
0 references
0 references
0 references
0 references
0 references
0.9059335
0 references
0.9059185
0 references
0 references
0.89866245
0 references
0.8886537
0 references
0.88779926
0 references
