Pages that link to "Item:Q799105"
From MaRDI portal
The following pages link to On the computational complexity of path cover problems (Q799105):
Displaying 14 items.
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q441867) (← links)
- On legal path problems in digraphs (Q790621) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- On the complexity of paths avoiding forbidden pairs (Q967328) (← links)
- Complexity of path discovery game problems (Q1566737) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Path covering problems and testing of printed circuits (Q1900134) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← links)
- Complexity of the path avoiding forbidden pairs problem revisited (Q2446333) (← links)
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q2861508) (← links)
- The Complexity of Restricted Variants of the Stable Paths Problem (Q3000275) (← links)
- Cardinality constrained path covering problems in grid graphs (Q3156826) (← links)
- Path Problems in Structured Graphs (Q3745869) (← links)
- (Q5091049) (← links)