How Good is Recursive Bisection?

No abstract is available for this paper.

• Publication year

  1997

• Venue

  SIAM Journal on Scientific Computing

• Publication date

  1997-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/S1064827593255135
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Geometric mesh partitioning: implementation and experiments

  1995cited by this paper
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations

  1995cited by this paper
• A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems

  1993cited by this paper
• Spectral K-Way Ratio-Cut Partitioning and Clustering

  1993cited by this paper
• Automatic Mesh Partitioning

  1992influential reference
• Quality mesh generation in three dimensions

  1992cited by this paper
• Points, spheres, and separators: a unified geometric approach to graph partitioning

  1992cited by this paper
• Results on triangulation and high quality mesh generation

  1992cited by this paper
• Execution time support for adaptive scientific algorithms on distributed memory machines

  1991cited by this paper
• Performance of dynamic load balancing algorithms for unstructured mesh calculations

  1991cited by this paper
• Partitioning of unstructured problems for parallel processing

  1991cited by this paper
• Solving unstructured grid problems on massively parallel computers

  1990cited by this paper
• A separator theorem for graphs with an excluded minor and its applications

  1990cited by this paper
• Provably good mesh generation

  1990cited by this paper
• PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*

  1990cited by this paper
• Guaranteed-Quality Triangular Meshes

  1989cited by this paper
• An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms

  1988cited by this paper
• A Partitioning Strategy for Nonuniform Problems on Multiprocessors

  1987cited by this paper
• The analysis of a nested dissection algorithm

  1987cited by this paper
• A Partitioning Strategy for Nonuniform Problems on Multiprocessors

  1987cited by this paper
• Efficient parallel solution of linear systems

  1985cited by this paper
• A Separator Theorem for Graphs of Bounded Genus

  1984cited by this paper
• Area-Efficient VLSI Computation

  1983cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Computer solution of large sparse positive definite systems

  1982cited by this paper
• Computers and Intractability: A Guide to the Theory of NP-Completeness

  1979cited by this paper
• Generalized nested dissection

  1977cited by this paper
• A Separator Theorem for Planar Graphs

  1977influential reference
• On sparse graphs with dense long paths.

  1975cited by this paper
• An Analysis of the Finite Element Method

  1974cited by this paper
• Nested Dissection of a Regular Finite Element Mesh

  1973cited by this paper
• Points

  1898influential reference

• Online Bisection with Ring Demands

  2026cites this paper
• AMRaCut: Scalable Partitioning for Adaptive Mesh Refinement

  2025cites this paper
• Deterministic Parallel High-Quality Hypergraph Partitioning

  2025cites this paper
• BlasPart: A Deterministic Parallel Partitioner for Balanced Large-Scale Hypergraph Partitioning

  2025cites this paper
• A Multipartition Kernighan-Lin Algorithm for Core Clustering in Ad-Hoc Networks-On-Chip

  2025cites this paper
• An efficient second-order adaptive procedure for inserting CAD geometries into hexahedral meshes using volume fractions

  2025influential citation
• Multipartition Core Clustering algorithm in Ad-Hoc NoCs based on Broadcast Algebra

  2025cites this paper
• Efficient Joint Communication and Computation Placement for Large-scale SNN Simulation on Supercomputers

  2025cites this paper
• Data Center Scheduling With Network Tasks

  2025cites this paper
• Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms

  2024cites this paper
• Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm

  2024cites this paper
• Numerical Methods for Statistical Data Generation

  2024cites this paper
• Higher-Order Cheeger Inequality for Partitioning with Buffers

  2023cites this paper
• Multi-class Graph Clustering via Approximated Effective p-Resistance

  2023cites this paper
• Open Problems in (Hyper)Graph Decomposition

  2023cites this paper
• Visibility graph and graph convolution networks-based segmentation of carbon emission in China

  2023cites this paper
• A Direct k-Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric

  2023cites this paper
• An Improvement of a Mapping Method Based on Ant Colony Algorithm Applied to Smart Cities

  2022cites this paper
• Improved Bounds for Online Balanced Graph Re-Partitioning

  2022cites this paper
• Quasi-Monte Carlo Methods for Binary Event Models with Complex Family Data

  2022cites this paper
• Evaluation of Local Search Heuristics for Graph Partitioning with Large k

  2022cites this paper
• Exact k-way sparse matrix partitioning

  2022cites this paper
• Composite Numerical Methods and Scalable Tile Algorithms

  2022influential citation
• Towards Informed Partitioning for Load Balancing: a Proof-of-Concept

  2021cites this paper
• Optimal Load Balancing and Assessment of Existing Load Balancing Criteria

  2021cites this paper
• Deterministic Parallel Hypergraph Partitioning

  2021cites this paper
• Shared-Memory n-level Hypergraph Partitioning

  2021cites this paper
• Balanced Districting on Grid Graphs with Provable Compactness and Contiguity

  2021cites this paper
• A Right Placement Makes a Happy Emulator: a Placement Module for Distributed SDN/NFV Emulation

  2020cites this paper
• On the application of recursive bisection and nested dissection reorderings for solving fractional diffusion problems using HSS compression

  2020cites this paper
• Multiway p-spectral graph cuts on Grassmann manifolds

  2020cites this paper
• K-way p-spectral clustering on Grassmann manifolds

  2020cites this paper
• Factorized Machine Learning for Performance Modeling of Massively Parallel Heterogeneous Physical Simulations

  2020cites this paper
• Distributed Network Experiment Emulation

  2019cites this paper
• Towards Next Generation Networks with SDN and NFV

  2019cites this paper
• Mininet on steroids: exploiting the cloud for Mininet performance

  2019cites this paper
• Parallel and External High Quality Graph Partitioning

  2019cites this paper
• Graph Partitioning for the Finite Element Method: Reducing Communication Volume with the Directed Sorted Heavy Edge Matching

  2019cites this paper
• Edge integrity of nearest neighbor graphs and separator theorems

  2019cites this paper
• Graph-based Semi-Supervised & Active Learning for Edge Flows

  2019cites this paper
• Load-Balancing for Parallel Delaunay Triangulations

  2019cites this paper
• Dual: Deploy stateful virtual network function chains by jointly allocating data-control traffic

  2019cites this paper
• When Network Matters: Data Center Scheduling with Network Tasks

  2019cites this paper
• R-BBG2: Recursive Bipartition of Bi-connected Graphs

  2018cites this paper
• Optimization of MPI-Process Mapping for Clusters with Angara Interconnect

  2018cites this paper
• Network Flow-Based Refinement for Multilevel Hypergraph Partitioning

  2018cites this paper
• A streaming graph library for Apache Flink Master Thesis

  2018cites this paper
• Tiered transferable pollutant pricing for cooperative control of air quality to alleviate cross-regional air pollution in China

  2018cites this paper
• Engineering a direct k-way Hypergraph Partitioning Algorithm

  2017cites this paper
• Local grid refinement for free-surface flow simulations

  2017cites this paper
• APHiD: Hierarchical Task Placement to Enable a Tapered Fat Tree Topology for Lower Power and Cost in HPC Networks

  2017cites this paper
• On the Minimum Bisection Problem in Tree-Like and Planar Graphs

  2017cites this paper
• Comparison of initial partitioning methods for multilevel direct k-way graph partitioning with fixed vertices

  2017cites this paper
• Load Balancing of Multi-physics Simulation by Multi-criteria Graph Partitioning

  2017cites this paper
• Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner

  2017cites this paper
• Building and operating large-scale SpiNNaker machines

  2016cites this paper
• Analysis of Processes Communication Structure for Better Mapping of Parallel Applications

  2016cites this paper
• Clustering and Community Detection With Imbalanced Clusters

  2016cites this paper
• Towards Understanding Optimal Load-Balancing of Heterogeneous Short-Range Molecular Dynamics

  2016cites this paper
• Compressing Graphs and Indexes with Recursive Graph Bisection

  2016cites this paper
• Latency-centric models and methods for scaling sparse operations (Seyrek işlemlerin ölçeklenebilmesi için gecikim-merkezli model ve yöntemler)

  2016cites this paper
• Memory Access Optimization for Computations on Unstructured Meshes

  2016cites this paper
• Parallélisation massive de dynamiques spatiales : contribution à la gestion durable du mildiou de la pomme de terre. (Massive scale parallelization of spatial dynamics : input for potato blight sustainable management)

  2016cites this paper
• Load Balancing for Parallel Coupled Simulations

  2016cites this paper
• Team Integration

  2016cites this paper
• Scalable Algorithms for Data and Network Analysis

  2016cites this paper
• Анализ структуры коммуникационных взаимодействий процессов для решения задачи мэппинга параллельных программ

  2016cites this paper
• On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width

  2015cites this paper
• Dynamic Balanced Graph Partitioning

  2015cites this paper
• Architecture Aware Resource Allocation for Structured Grid Applications: Flood Modelling Case

  2015cites this paper
• A New Procedure for Optimal Design of District Metered Areas Based on the Multilevel Balancing and Refinement Algorithm

  2015cites this paper
• Personalized Medicine in Chronic Disease Management.

  2015cites this paper
• On Balanced Separators in Road Networks

  2015cites this paper
• On the bandwidth of the Kneser graph

  2015cites this paper
• Approximating Minimum k-Section in Trees with Linear Diameter

  2015cites this paper
• PaCMap: Topology Mapping of Unstructured Communication Patterns onto Non-contiguous Allocations

  2015cites this paper
• An Overview of Process Mapping Techniques and Algorithms in High-Performance Computing

  2014cites this paper
• An Overview of Topology Mapping Algorithms and Techniques in High‐Performance Computing

  2014cites this paper
• Heuristic for solving cyclic bandwidth sum problem by following the structure of the graph

  2014cites this paper
• Fast Consistency Checking of Very Large Real-World RCC-8 Constraint Networks Using Graph Partitioning

  2014cites this paper
• Graph Bisection Modeled as Binary Quadratic Task Allocation and Solved via Tabu Search

  2014cites this paper
• Enumeration technique in very large-scale integration fixed-outline floorplanning

  2014cites this paper
• A divide and conquer strategy for scaling weather simulations with multiple regions of interest 1

  2014cites this paper
• Large Wireless Ad Hoc Network Clustering with End-to-End QoS Constraints Using Multiobjective Particle Swarm Optimization

  2014cites this paper
• Computational Complexities of Optimization Problems Related to Model-Based Clustering of Networks

  2014cites this paper
• Hierarchical graph partitioning

  2014cites this paper
• Minimization of Resource Consumption through Workload Consolidation in Large-Scale Distributed Data Platforms

  2014cites this paper
• Discovering the structure of complex networks by minimizing cyclic bandwidth sum

  2014cites this paper
• SWORD: workload-aware data placement and replica selection for cloud data management systems

  2014cites this paper
• A graph partitioning strategy for solving large-scale crew scheduling problems

  2014cites this paper
• Multiply Balanced k -Partitioning

  2014cites this paper
• ls1 mardyn: The massively parallel molecular dynamics code for large systems

  2014cites this paper
• Spectral clustering with physical intuition on spring-mass dynamics

  2014cites this paper
• Evaluation and enhancement of weather application performance on Blue Gene/Q

  2013cites this paper
• Solving Digital Circuit Layout Problem based on Graph Partitioning Technique: A Glance

  2013cites this paper
• Parallelization of Graph Partitioning

  2013cites this paper
• Combinatorial Optimization of the Discretized Multiphase Mumford–Shah Functional

  2013cites this paper
• Data Placement and Replica Selection for Improving Co-location in Distributed Environments

  2013cites this paper
• A Comparison Study of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Ileterogeneous Distributed Computing Systems

  2013cites this paper
• Recent Advances in Graph Partitioning

  2013cites this paper