The following pages link to Finding small balanced separators (Q2931401):
Displaying 17 items.
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- Most balanced minimum cuts (Q968139) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Finding good approximate vertex and edge partitions is NP-hard (Q1198051) (← links)
- On classes of graphs with strongly sublinear separators (Q1750205) (← links)
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem (Q1753627) (← links)
- Solution methods for the vertex variant of the network system vulnerability analysis problem (Q2017536) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Algorithms for Multiterminal Cuts (Q3503649) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- (Q5002797) (← links)
- (Q5053191) (← links)
- The Valve Location Problem in Simple Network Topologies (Q5302043) (← links)
- Approximating small balanced vertex separators in almost linear time (Q5919618) (← links)
- Fission: Practical algorithms for computing minimum balanced node separators (Q6115756) (← links)
