A parallel algorithm for bisection width in trees
type: Item
instance of: scholarly article
title: A parallel algorithm for bisection width in trees
zbMATH Open document ID: 0645.68075
DOI: 10.1016/0898-1221(88)90210-6
author: B. George
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4053040
zbMATH Keywords: bisection width
zbMATH Keywords: parallel algorithm
MaRDI profile type: Publication
full work available at URL: 0898-1221(88)90210-6
OpenAlex ID: W2088422597
cites work: Some simplified NP-complete graph problems
cites work: Optimal partitions having disjoint convex and conic hulls
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Parallel concepts in graph theory
cites work: Q4065051
cites work: Parallelism in Comparison Problems
cites work: Finding the maximum, merging, and sorting in a parallel computation model
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 4053040