Min-max-boundary domain decomposition
From MaRDI portal
Publication:5941438
DOI10.1016/S0304-3975(00)00143-2zbMath0972.68086MaRDI QIDQ5941438
Marcos A. Kiwi, Shang-Hua Teng, Daniel A. Spielman
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
domain decompositionparallel processingcommunication to computation ratiomulti-way partitioningsurface-to-volume ratio
Related Items (2)
Optimal cache-oblivious mesh layouts ⋮ Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition
Cites Work
- Unnamed Item
- Unnamed Item
- A framework for solving VLSI graph layout problems
- Parallel computation with adaptive methods for elliptic and hyperbolic systems
- A separator theorem for graphs of bounded genus
- An Iterative Method for Elliptic Problems on Regions Partitioned into Substructures
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A Separator Theorem for Planar Graphs
- Generalized Nested Dissection
- Geometric Mesh Partitioning: Implementation and Experiments
- Separators for sphere-packings and nearest neighbor graphs
- How Good is Recursive Bisection?
- Geometric Separators for Finite-Element Meshes
- Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
This page was built for publication: Min-max-boundary domain decomposition
