Minimum-perimeter domain assignment
DOI10.1007/BF02614375zbMATH Open0890.90177OpenAlexW2066407696MaRDI QIDQ1373754FDOQ1373754
Authors: Jonathan Yackel, Robert R. Meyer, Ioannis T. Christou
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614375
Recommendations
assignment of grid cellsminimizing interprocessor communicationminimum-perimeter tilesnonlinear network model
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- An Efficient Heuristic Procedure for Partitioning Graphs
- Title not available (Why is that?)
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Title not available (Why is that?)
- Coding the convex polyominoes and equations for the enumeration according to the area
- Encoding Data Structures in Trees
- Domain decomposition methods in computational fluid dynamics
- Optimal equi-partition of rectangular domains for parallel computation
- Title not available (Why is that?)
- Optimal Balanced Assignments and a Parallel Database Application
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: Minimum-perimeter domain assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373754)