Pages that link to "Item:Q4863978"
From MaRDI portal
The following pages link to Treewidth and Pathwidth of Permutation Graphs (Q4863978):
Displaying 6 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
