Pages that link to "Item:Q3508575"
From MaRDI portal
The following pages link to How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575):
Displaying 5 items.
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- (Q4475307) (← links)