Pages that link to "Item:Q2442211"
From MaRDI portal
The following pages link to Digraph width measures in parameterized algorithmics (Q2442211):
Displaying 20 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Directed NLC-width (Q906393) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs (Q2232245) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- On Directed Covering and Domination Problems (Q5136265) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Twin-distance-hereditary digraphs (Q6132965) (← links)
- Safe sets and in-dominating sets in digraphs (Q6153473) (← links)
