The following pages link to (Q2753956):
Displaying 6 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- Neighbourhood-width of trees (Q501055) (← links)
- Computing the vertex separation of unicyclic graphs (Q596295) (← links)
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
