An optimal parallel algorithm forc-vertex-ranking of trees (Q834935)
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: An optimal parallel algorithm forc-vertex-ranking of trees |
scientific article; zbMATH DE number 5599153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal parallel algorithm forc-vertex-ranking of trees |
scientific article; zbMATH DE number 5599153 |
Statements
An optimal parallel algorithm forc-vertex-ranking of trees (English)
0 references
27 August 2009
0 references
ordered coloring
0 references
parallel algorithms
0 references
separator-tree
0 references
tree contraction
0 references
vertex-ranking
0 references
0 references
0.92025095
0 references
0.9116041
0 references
0.91064024
0 references
0.90334004
0 references
0 references
0 references
