Pages that link to "Item:Q3192022"
From MaRDI portal
The following pages link to Approximating the minimum bisection size (extended abstract) (Q3192022):
Displayed 9 items.
- Heuristics for semirandom graph problems (Q1604213) (← links)
- On cutting a few vertices from a graph (Q1811082) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- (Q5002797) (← links)
- (Q5075784) (← links)
- (Q5111755) (← links)
- Dynamic Balanced Graph Partitioning (Q5130579) (← links)
- A note on internal partitions: the 5-regular case and beyond (Q6121923) (← links)