Pages that link to "Item:Q4962735"

The following pages link to Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> ³ ) Time (Q4962735):

Displaying 28 items.

• (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
• Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
• New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
• A note on planar graphs with large width parameters and small grid-minors (Q423947) (← links)
• Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
• Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
• The carving-width of generalized hypercubes (Q710586) (← links)
• Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
• Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
• Computational study on planar dominating set problem (Q1040587) (← links)
• An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
• Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
• Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
• C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
• Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
• Efficient reassembling of three-regular planar graphs (Q2175057) (← links)
• Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
• Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs (Q2839212) (← links)
• (Q4972036) (← links)
• A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
• Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
• (Q5743390) (← links)
• (Q5743430) (← links)
• Tangle bases: Revisited (Q6087071) (← links)
• Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)
• The role of twins in computing planar supports of hypergraphs (Q6616221) (← links)