scientific article; zbMATH DE number 1942408
From MaRDI portal
Publication:4409104
Recommendations
- An efficient approach for large scale graph partitioning
- A computational study of graph partitioning
- scientific article; zbMATH DE number 5761786
- Comparing recent methods in graph partitioning
- Efficient algorithms for a graph partitioning problem
- Graph partitioning: an updated survey
- scientific article; zbMATH DE number 991436
- Efficient generation of graphical partitions
- Graph partitioning
- Fast Approximate Graph Partitioning Algorithms
Cited in
(14)- Quality matching and local improvement for multilevel graph-partitioning
- scientific article; zbMATH DE number 5990414 (Why is no real title available?)
- Comparison of algorithms in graph partitioning
- scientific article; zbMATH DE number 6501141 (Why is no real title available?)
- Finding part-machine families using graph partitioning techniques
- scientific article; zbMATH DE number 1953093 (Why is no real title available?)
- scientific article; zbMATH DE number 910878 (Why is no real title available?)
- An Updated Experimental Evaluation of Graph Bipartization Methods
- Graph partitioning: an updated survey
- An efficient algorithm for the parallel solution of high-dimensional differential equations
- Minimum bisections of graphs without even cycles
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
- Local expansion concepts for detecting transport barriers in dynamical systems
- Upper bounds on the bisection width of 3- and 4-regular graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409104)