Pages that link to "Item:Q1198051"
From MaRDI portal
The following pages link to Finding good approximate vertex and edge partitions is NP-hard (Q1198051):
Displayed 50 items.
- Extended cuts (Q266025) (← links)
- Parallel multilevel algorithms for hypergraph partitioning (Q436760) (← links)
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (Q525113) (← links)
- An exact algorithm for solving the vertex separator problem (Q628743) (← links)
- A note on edge-based graph partitioning and its linear algebraic structure (Q662140) (← links)
- A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
- A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries (Q728770) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- On the complexity of finding balanced oneway cuts (Q1014383) (← links)
- Balanced cut approximation in random geometric graphs (Q1029344) (← links)
- Using domain decomposition to find graph bisectors (Q1371661) (← links)
- An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
- Parallel adaptive subspace correction schemes with applications to elasticity (Q1574336) (← links)
- Finding the biased-shortest path with minimal congestion in networks via linear-prediction of queue length (Q1619461) (← links)
- A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081) (← links)
- Moving clusters within a memetic algorithm for graph partitioning (Q1665049) (← links)
- General variable neighborhood search for computing graph separators (Q1677293) (← links)
- Spectral bisection with two eigenvectors (Q1690049) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem (Q1753627) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
- On cutting a few vertices from a graph (Q1811082) (← links)
- Solution methods for the vertex variant of the network system vulnerability analysis problem (Q2017536) (← links)
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization (Q2077960) (← links)
- Network bipartitioning in the anti-communicability Euclidean space (Q2131522) (← links)
- A review on spectral clustering and stochastic block models (Q2132025) (← links)
- A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- Computing semantic clusters by semantic mirroring and spectral graph partitioning (Q2254077) (← links)
- On chromatic number and minimum cut (Q2338633) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- A Tetrahedral Space-Filling Curve for Nonconforming Adaptive Meshes (Q2821775) (← links)
- Advanced Coarsening Schemes for Graph Partitioning (Q2828188) (← links)
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures (Q3300489) (← links)
- Knowledge Discovery in Graphs Through Vertex Separation (Q3305126) (← links)
- Transport optimization on complex networks (Q3624815) (← links)
- IMPROVED EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS (Q4918284) (← links)
- Improvements on Spectral Bisection (Q4989699) (← links)
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm (Q5075796) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- Structure Detection in Mixed-Integer Programs (Q5136081) (← links)
- (Q5140710) (← links)
- A New Lower Bound on the Size of the Smallest Vertex Separator of a Graph (Q5862814) (← links)
- Balanced line separators of unit disk graphs (Q5918796) (← links)
- Approximating small balanced vertex separators in almost linear time (Q5919618) (← links)
- ILP-Based Local Search for Graph Partitioning (Q6039924) (← links)