A parallel algorithm for bisection width in trees (Q1103410): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal partitions having disjoint convex and conic hulls / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4065051 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallelism in Comparison Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding the maximum, merging, and sorting in a parallel computation model / rank | |||
Normal rank |
Latest revision as of 16:27, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A parallel algorithm for bisection width in trees |
scientific article |
Statements
A parallel algorithm for bisection width in trees (English)
0 references
1988
0 references
bisection width
0 references
parallel algorithm
0 references