Pages that link to "Item:Q2922218"
From MaRDI portal
The following pages link to Arc-Disjoint Paths in Decomposable Digraphs (Q2922218):
Displaying 14 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- 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)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) (Q3297784) (← links)
- Disjoint Paths in Decomposable Digraphs (Q5272934) (← links)