A parallel algorithm for bisection width in trees
From MaRDI portal
Publication:1103410
DOI10.1016/0898-1221(88)90210-6zbMath0645.68075OpenAlexW2088422597MaRDI QIDQ1103410
Publication date: 1988
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(88)90210-6
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (7)
Bisection of bounded treewidth graphs by convolutions ⋮ Clustering without replication in combinatorial circuits ⋮ Spectral methods for graph bisection problems. ⋮ Unnamed Item ⋮ Analyzing clustering and partitioning problems in selected VLSI models ⋮ Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons ⋮ Algorithms for graph partitioning problems by means of eigenspace relaxations
Cites Work
- Unnamed Item
- Optimal partitions having disjoint convex and conic hulls
- Some simplified NP-complete graph problems
- Parallel concepts in graph theory
- A taxonomy of problems with fast parallel algorithms
- Finding the maximum, merging, and sorting in a parallel computation model
- Parallelism in Comparison Problems
This page was built for publication: A parallel algorithm for bisection width in trees
