An algorithm for partitioning trees augmented with sibling edges (Q975430): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.04.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035890212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A model for the evaluation of storage hierarchies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Linear Tree Partitioning Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Latest revision as of 22:24, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for partitioning trees augmented with sibling edges |
scientific article |
Statements
An algorithm for partitioning trees augmented with sibling edges (English)
0 references
9 June 2010
0 references
algorithms
0 references
analysis of algorithms
0 references
graph algorithms
0 references
