Pages that link to "Item:Q5462383"

The following pages link to Cutwidth I: A linear time fixed parameter algorithm (Q5462383):

Displaying 34 items.

• Branch and bound for the cutwidth minimization problem (Q339558) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• The structure of graphs not admitting a fixed immersion (Q473098) (← links)
• The treewidth of line graphs (Q723884) (← links)
• Invariants of graph drawings in the plane (Q778122) (← links)
• Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
• Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
• On spanning tree congestion of graphs (Q1043936) (← links)
• Scheduling series-parallel task graphs to minimize peak memory (Q1685958) (← links)
• An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
• Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
• A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
• On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
• Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
• Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
• Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
• Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
• THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Reachability in Graph Transformation Systems and Slice Languages (Q2947215) (← links)
• Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
• (Q5009465) (← links)
• Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
• (Q5028484) (← links)
• Computing Tree Decompositions (Q5042458) (← links)
• A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
• (Q5091271) (← links)
• (Q5092419) (← links)
• Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
• Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
• Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (Q5302057) (← links)
• (Q5874536) (← links)
• Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
• Parameterized algorithms for minimum sum vertex cover (Q6547957) (← links)