Pages that link to "Item:Q1942271"
From MaRDI portal
The following pages link to An exact algorithm for graph partitioning (Q1942271):
Displaying 27 items.
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- A hybrid exact algorithm for complete set partitioning (Q901033) (← links)
- A linear time algorithm for graph partition problems (Q1198016) (← links)
- An algorithm to maximize the agreement between partitions (Q1203100) (← links)
- Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115) (← links)
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes (Q1751235) (← links)
- A fast randomized algorithm for partitioning a graph into paths of fixed length (Q1803681) (← links)
- An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- (Q2721969) (← links)
- Advanced coarsening schemes for graph partitioning (Q2828188) (← links)
- Exact algorithms for the vertex separator problem in graphs (Q3008917) (← links)
- (Q3105855) (← links)
- Comparison of algorithms in graph partitioning (Q3163669) (← links)
- Lower bounds to the graph partitioning problem through generalized linear programming and network flows (Q3807012) (← links)
- (Q3821604) (← links)
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée (Q4546064) (← links)
- Constrained Graph Partitioning via Matrix Differential Equations (Q4615297) (← links)
- (Q5140710) (← links)
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS (Q5261015) (← links)
- ILP-Based Local Search for Graph Partitioning (Q6039924) (← links)
- A strong formulation for the graph partition problem (Q6068542) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
