Pages that link to "Item:Q2864292"
From MaRDI portal
The following pages link to On the Parameterized Complexity of Computing Graph Bisections (Q2864292):
Displaying 9 items.
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Bisection of bounded treewidth graphs by convolutions (Q2662673) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- (Q5075784) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
