Pages that link to "Item:Q5233518"
From MaRDI portal
The following pages link to Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs (Q5233518):
Displaying 6 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- Planar branch decompositions. I: The ratcatcher (Q2892257) (← links)
- Planar branch decompositions. II: The cycle method (Q2892258) (← links)
