Pages that link to "Item:Q673224"
From MaRDI portal
The following pages link to Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224):
Displaying 38 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485) (← links)
- Max-min weight balanced connected partition (Q386475) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Balanced connected graph partition (Q831759) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- Most balanced minimum cuts (Q968139) (← links)
- Bisecting a 4-connected graph with three resource sets (Q997070) (← links)
- Structural and algorithmic properties of 2-community structures (Q1635716) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- On finding connected balanced partitions of trees (Q2028065) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
- Graphs without a partition into two proportionally dense subgraphs (Q2281161) (← links)
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs (Q2427693) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- Metaheuristics for the minimum gap graph partitioning problem (Q2668747) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- Approximation algorithms for maximization problems arising in graph partitioning (Q2775885) (← links)
- Solving the maximally balanced connected partition problem in graphs by using genetic algorithm (Q2844500) (← links)
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs (Q2905305) (← links)
- New Insight into 2-Community Structures in Graphs with Applications in Social Networks (Q3467849) (← links)
- Balanced Connected Partitioning of Unweighted Grid Graphs (Q5005141) (← links)
- (Q5708519) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918464) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918819) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925556) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925672) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)
- 3D geo-graphs: efficient flip verification for the spherical zoning problem (Q6110624) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
