Pages that link to "Item:Q4895809"

The following pages link to Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs (Q4895809):

Displaying 50 items.

• Linear rank-width and linear clique-width of trees (Q2346380) (← links)
• On compiling structured CNFs to OBDDs (Q2411046) (← links)
• Imbalance is fixed parameter tractable (Q2445234) (← links)
• Node-searching problem on block graphs (Q2462351) (← links)
• Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
• Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
• Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
• A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
• Faster Computation of Path-Width (Q2819521) (← links)
• Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
• Parameterized complexity of discrete Morse theory (Q2828168) (← links)
• FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
• Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
• The point-set embeddability problem for plane graphs (Q2875647) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
• An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) (← links)
• Strengthening Erdös-Pósa property for minor-closed graph classes (Q3083410) (← links)
• Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
• A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
• On Compiling Structured CNFs to OBDDs (Q3194709) (← links)
• Pathwidth of Circular-Arc Graphs (Q3508573) (← links)
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t (Q4210144) (← links)
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree (Q4327821) (← links)
• A Simpler Self-reduction Algorithm for Matroid Path-Width (Q4569568) (← links)
• Constructive linear time algorithms for branchwidth (Q4571992) (← links)
• (Q4691777) (← links)
• (Q4691905) (← links)
• Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
• A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
• Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
• Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Q5019599) (← links)
• (Q5028484) (← links)
• As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
• Computing Tree Decompositions (Q5042458) (← links)
• A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
• (Q5136229) (← links)
• (Q5136255) (← links)
• (Q5150424) (← links)
• (Q5150500) (← links)
• (Q5150524) (← links)
• Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
• AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH (Q5249045) (← links)
• Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
• Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)
• Excluded Forest Minors and the Erdős–Pósa Property (Q5397727) (← links)
• Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
• (Q5874536) (← links)
• Graph-Theoretic Concepts in Computer Science (Q5897572) (← links)