Pages that link to "Item:Q1790979"
From MaRDI portal
The following pages link to Directed path-width and directed tree-width of directed co-graphs (Q1790979):
Displaying 12 items.
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- The knapsack problem with special neighbor constraints (Q2123119) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) (Q3297784) (← links)
- A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time (Q4685763) (← links)
- Characterizations and directed path-width of sequence digraphs (Q6038712) (← links)
- Computing directed path-width and directed tree-width of recursively defined digraphs (Q6302908) (← links)