Pages that link to "Item:Q5087707"
From MaRDI portal
The following pages link to Solving the Distance-Based Critical Node Problem (Q5087707):
Displaying 3 items.
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
- A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)
