Pages that link to "Item:Q5102046"
From MaRDI portal
The following pages link to Data Reduction for Maximum Matching on Real-World Graphs (Q5102046):
Displaying 5 items.
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- Parameterized complexity of diameter (Q5925618) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- Effective data reduction for strongly stable matching in very sparse graphs (Q6663523) (← links)
- The complexity of optimizing atomic congestion (Q6665726) (← links)
