Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(8 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
Property / describes a project that uses
 
Property / describes a project that uses: Zoltan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UMPa / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KaHyPar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Stata / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1802.03587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering a direct <i>k</i>-way Hypergraph Partitioning Algorithm / 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: Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Flows by Incremental Breadth-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hypergraphs by graphs with the same mincut properties / 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: Cutsets and partitions of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Approximation Algorithms and Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of all minimum cuts in a network and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-way network partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Multilevel Graph Partitioning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>-way Hypergraph Partitioning via <i>n</i>-Level Recursive Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel multilevel algorithms for hypergraph partitioning / 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: A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962835892 / rank
 
Normal rank
Property / title
 
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (English)
Property / title: Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (English) / rank
 
Normal rank

Latest revision as of 10:26, 30 July 2024

scientific article; zbMATH DE number 7286674
Language Label Description Also known as
English
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
scientific article; zbMATH DE number 7286674

    Statements

    0 references
    0 references
    0 references
    16 December 2020
    0 references
    multilevel hypergraph partitioning
    0 references
    network flows
    0 references
    refinement
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references