Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices (Q436766): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: hMETIS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: METIS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PaToH / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaco / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jpdc.2007.09.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4300646857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent directions in netlist partitioning: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Graphs and the Minimum Degree Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permuting Sparse Rectangular Matrices into Block-Diagonal Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Run Time and Quality of Nested Dissection Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Good is Recursive Bisection? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Hypergraph Models for Sparse Matrix Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel image restoration using surrogate constraint methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiphase mesh partitioning / rank
 
Normal rank

Revision as of 11:38, 5 July 2024

scientific article
Language Label Description Also known as
English
Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
scientific article

    Statements

    Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2012
    0 references
    hypergraph partitioning
    0 references
    multi-level paradigm
    0 references
    recursive bisection
    0 references
    direct \(K\)-way refinement
    0 references
    multi-constraint
    0 references
    fixed vertices
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers