Pages that link to "Item:Q1333276"
From MaRDI portal
The following pages link to The vertex separation and search number of a graph (Q1333276):
Displaying 6 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Narrowness, pathwidth, and their application in natural language processing (Q1186169) (← links)
- On the domination search number (Q1811076) (← links)
