Graph and hypergraph partitioning
From MaRDI portal
Publication:4635986
zbMATH Open1388.05153MaRDI QIDQ4635986FDOQ4635986
Authors: Sachin Patkar, H. Narayanan
Publication date: 23 April 2018
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (12)
- Title not available (Why is that?)
- Factorization-Based Graph Repartitionings
- Title not available (Why is that?)
- Partitioning problems in dense hypergraphs
- Hypergraph partitioning
- Title not available (Why is that?)
- Graph partitioning: an updated survey
- Title not available (Why is that?)
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning
- Partitioning multi-edge graphs
- Title not available (Why is that?)
- General introduction to graph partitioning
This page was built for publication: Graph and hypergraph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635986)