Pages that link to "Item:Q1198094"

The following pages link to The vertex separation number of a graph equals its path-width (Q1198094):

Displaying 38 items.

• Lower bounds on the pathwidth of some grid-like graphs (Q2476243) (← links)
• Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
• The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
• FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
• Fixed-Parameter Tractability, A Prehistory, (Q2908528) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• PATH-WIDTH OF A GRAPH VS BRIDGE NUMBER OF A KNOT (Q3004777) (← links)
• Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (Q3012830) (← links)
• A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
• Refinements on an enumeration scheme for solving a pattern sequencing problem (Q3158869) (← links)
• NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY (Q3444837) (← links)
• The total vertex separation number and profile of a graph (Q4522798) (← links)
• The Effect of Planarization on Width (Q4625143) (← links)
• (Q4691777) (← links)
• The Effect of Planarization on Width (Q4961755) (← links)
• Randomly coloring graphs of logarithmically bounded pathwidth (Q5009556) (← links)
• (Q5028484) (← links)
• A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
• Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
• Bounding the search number of graph products (Q5215862) (← links)
• Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
• Searching for a Visible, Lazy Fugitive (Q5302068) (← links)
• Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)
• Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
• (Q5874536) (← links)
• A 3-approximation for the pathwidth of Halin graphs (Q5898649) (← links)
• Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
• Graph classes and the switch Markov chain for matchings (Q5963358) (← links)
• Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
• Order Reconfiguration under Width Constraints (Q6075707) (← links)
• On the complexity of the storyplan problem (Q6078287) (← links)
• Connected search for a lazy robber (Q6080862) (← links)
• Edge searching and fast searching with constraints (Q6122599) (← links)
• The Treewidth and Pathwidth of Graph Unions (Q6141861) (← links)
• Graph searching on chordal graphs (Q6487435) (← links)
• Constrained graph searching on trees (Q6535820) (← links)
• Parameterized algorithms for fixed-order book drawing with few crossings per edge (Q6569894) (← links)
• A cops and robber game and the meeting time of synchronous directed walks (Q6599064) (← links)