The following pages link to (Q3575418):
Displaying 28 items.
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934) (← links)
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning (Q731499) (← links)
- Path optimization for graph partitioning problems (Q1276954) (← links)
- Graph partitioning models for parallel computing (Q1583333) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Partitioning graphs on message-passing machines by pairwise mincut (Q1818794) (← links)
- (Q2721969) (← links)
- General introduction to graph partitioning (Q2912413) (← links)
- Hypergraph partitioning (Q2912415) (← links)
- Parallelization of graph partitioning (Q2912416) (← links)
- Local metaheuristics and graph partitioning (Q2912418) (← links)
- Population-based metaheuristics, fusion-fission and graph partitioning optimization (Q2912419) (← links)
- Application of graph partitioning to image segmentation (Q2912423) (← links)
- The main tools and test benches for graph partitioning (Q2912428) (← links)
- Disturbed diffusive processes for solving partitioning problems on graphs (Q2922529) (← links)
- (Q3105855) (← links)
- (Q3194389) (← links)
- Comparing recent methods in graph partitioning (Q3439313) (← links)
- Algorithm Engineering for Optimal Graph Bipartization (Q3627967) (← links)
- (Q3821604) (← links)
- (Q4409104) (← links)
- Graph Partitioning and Continuous Quadratic Programming (Q4699174) (← links)
- (Q4886052) (← links)
- (Q5140710) (← links)
- (Semi-)External Algorithms for Graph Partitioning and Clustering (Q5232520) (← links)
- OPTIMAL FOLDING OF DATA FLOW GRAPHS BASED ON FINITE PROJECTIVE GEOMETRY USING VECTOR SPACE PARTITIONING (Q5411798) (← links)
- Experimental and Efficient Algorithms (Q5710023) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
