Pages that link to "Item:Q3192022"
From MaRDI portal
The following pages link to Approximating the minimum bisection size (extended abstract) (Q3192022):
Displaying 18 items.
- A 2-approximation for the maximum satisfying bisection problem (Q531427) (← links)
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- Finding good approximate vertex and edge partitions is NP-hard (Q1198051) (← links)
- Heuristics for semirandom graph problems (Q1604213) (← links)
- On cutting a few vertices from a graph (Q1811082) (← links)
- Minimum transversals of maximum matchings as approximate solutions to the bisection problem (Q1913329) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- A polylogarithmic approximation of the minimum bisection (Q2784494) (← links)
- Vertex Bisection is Hard, too (Q3184606) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- (Q5002797) (← links)
- (Q5075784) (← links)
- (Q5111755) (← links)
- Dynamic Balanced Graph Partitioning (Q5130579) (← links)
- Bisections above Tight Lower Bounds (Q5200505) (← links)
- A Polylogarithmic Approximation of the Minimum Bisection (Q5470837) (← links)
- A note on internal partitions: the 5-regular case and beyond (Q6121923) (← links)
- A parameterized approximation scheme for min \(k\)-cut (Q6654555) (← links)