An optimal parallel algorithm forc-vertex-ranking of trees (Q834935): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2004.07.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2004.07.007 / rank | |||
Normal rank | |||
Latest revision as of 11:27, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal parallel algorithm forc-vertex-ranking of trees |
scientific article |
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
