Pages that link to "Item:Q306256"
From MaRDI portal
The following pages link to Approximate tree decompositions of planar graphs in linear time (Q306256):
Displaying 9 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- On computing the Hamiltonian index of graphs (Q2699968) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← 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)
- (Q4273851) (← links)
- On Computing the Hamiltonian Index of Graphs (Q5042256) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
