Constrained Min-Cut Replication for <i>K</i>-Way Hypergraph Partitioning (Q2962559): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2013.0567 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061527589 / 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: Q4792738 / 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: Coverings of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and Reducibility of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the block triangular form of a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank

Latest revision as of 10:21, 13 July 2024

scientific article
Language Label Description Also known as
English
Constrained Min-Cut Replication for <i>K</i>-Way Hypergraph Partitioning
scientific article

    Statements

    Constrained Min-Cut Replication for <i>K</i>-Way Hypergraph Partitioning (English)
    0 references
    0 references
    0 references
    17 February 2017
    0 references
    combinatorial optimization
    0 references
    graphs
    0 references
    heuristics
    0 references
    optimization
    0 references
    programming: integer
    0 references
    0 references
    0 references
    0 references

    Identifiers

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