Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
From MaRDI portal
Publication:2962559
DOI10.1287/ijoc.2013.0567zbMath1356.90130OpenAlexW2061527589MaRDI QIDQ2962559
Publication date: 17 February 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2013.0567
Programming involving graphs or networks (90C35) Hypergraphs (05C65) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- The university of Florida sparse matrix collection
- Recent directions in netlist partitioning: a survey
- Coverings of Bipartite Graphs
- Connectivity and Reducibility of Graphs
- Computing the block triangular form of a sparse matrix
- Depth-First Search and Linear Graph Algorithms
- Two Algorithms for Bipartite Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item