Pages that link to "Item:Q5259566"
From MaRDI portal
The following pages link to Minimum bisection is fixed parameter tractable (Q5259566):
Displaying 27 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)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs (Q2258080) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← 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)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- Euler Digraphs (Q3120436) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- (Q5002797) (← links)
- (Q5075784) (← links)
- (Q5092387) (← links)
- (Q5111755) (← links)
- Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
