Pages that link to "Item:Q5462384"
From MaRDI portal
The following pages link to Cutwidth II: Algorithms for partial w-trees of bounded degree (Q5462384):
Displaying 29 items.
- Confronting intractability via parameters (Q465686) (← links)
- The structure of graphs not admitting a fixed immersion (Q473098) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- The treewidth of line graphs (Q723884) (← 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)
- 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)
- Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
- Decomposability of a class of \(k\)-cutwidth critical graphs (Q2125221) (← links)
- Decompositions of critical trees with cutwidth \(k\) (Q2326339) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Imbalance is fixed parameter tractable (Q2445234) (← links)
- Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
- A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem (Q2840754) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← 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)
- Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (Q5302057) (← links)
- (Q5874536) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
