Pages that link to "Item:Q3297784"
From MaRDI portal
The following pages link to Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) (Q3297784):
Displaying 8 items.
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- The Steiner cycle and path cover problem on interval graphs (Q2075469) (← 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)
