Pages that link to "Item:Q472485"
From MaRDI portal
The following pages link to Practical and efficient split decomposition via graph-labelled trees (Q472485):
Displaying 12 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Splitting cubic circle graphs (Q726651) (← links)
- Diamond-free circle graphs are Helly circle (Q965965) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- On complexities of minus domination (Q1751171) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- Linear time split decomposition revisited (Q2910928) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes (Q3523216) (← links)
- Extending partial representations of circle graphs in near-linear time (Q6582371) (← links)