scientific article; zbMATH DE number 5761786
From MaRDI portal
Publication:3575418
zbMATH Open1202.90004MaRDI QIDQ3575418FDOQ3575418
Authors:
Publication date: 27 July 2010
Title of this publication is not available (Why is that?)
Recommendations
- Graph and hypergraph partitioning
- Graph partitioning using linear and semidefinite programming
- scientific article; zbMATH DE number 991436
- A computational study of graph partitioning
- Computational aspects of greedy partitioning of graphs
- Graph partitioning: an updated survey
- Some graph partitioning problems
- Approximation Algorithms for Some Graph Partitioning Problems
Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Cited In (29)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Population-based metaheuristics, fusion-fission and graph partitioning optimization
- Algorithm Engineering for Optimal Graph Bipartization
- Graph Partitioning and Continuous Quadratic Programming
- Application of graph partitioning to image segmentation
- OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING
- Title not available (Why is that?)
- Hypergraph partitioning
- The main tools and test benches for graph partitioning
- (Semi-)External Algorithms for Graph Partitioning and Clustering
- Graph partitioning: an updated survey
- Comparing recent methods in graph partitioning
- Path optimization for graph partitioning problems
- Title not available (Why is that?)
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning
- Local metaheuristics and graph partitioning
- Experimental and Efficient Algorithms
- Graph and hypergraph partitioning
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
- Title not available (Why is that?)
- Parallelization of graph partitioning
- Title not available (Why is that?)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
- General introduction to graph partitioning
- Title not available (Why is that?)
- Partitioning graphs on message-passing machines by pairwise mincut
- Graph partitioning models for parallel computing
- Disturbed diffusive processes for solving partitioning problems on 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 Q3575418)
