Pages that link to "Item:Q2910928"
From MaRDI portal
The following pages link to Linear Time Split Decomposition Revisited (Q2910928):
Displaying 13 items.
- Between treewidth and clique-width (Q300479) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- On complexities of minus domination (Q1751171) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- On Computing the Gromov Hyperbolicity (Q2828207) (← links)
- Between Treewidth and Clique-Width (Q2945207) (← links)
- (Q5091021) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
