Pages that link to "Item:Q2211355"
From MaRDI portal
The following pages link to The power of linear-time data reduction for maximum matching (Q2211355):
Displaying 8 items.
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- Data Reduction for Maximum Matching on Real-World Graphs (Q5102046) (← links)
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality (Q5131226) (← links)
- Parameterized complexity of diameter (Q5925618) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- Backdoor DNFs (Q6564620) (← links)
- Effective data reduction for strongly stable matching in very sparse graphs (Q6663523) (← links)
