Pages that link to "Item:Q2032346"
From MaRDI portal
The following pages link to Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346):
Displayed 5 items.
- An FPT algorithm for matching cut and d-cut (Q2115892) (← links)
- (Dis)assortative partitions on random regular graphs (Q5877003) (← links)
- The perfect matching cut problem revisited (Q5925551) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)