Pages that link to "Item:Q896665"
From MaRDI portal
The following pages link to Practical algorithms for branch-decompositions of planar graphs (Q896665):
Displaying 8 items.
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Planar branch decompositions. I: The ratcatcher (Q2892257) (← links)
- Planar branch decompositions. II: The cycle method (Q2892258) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (Q3652285) (← links)
- (Q4642885) (← links)
- (Q4724430) (← links)
- Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs (Q5233518) (← links)
