The following pages link to (Q3341926):
Displaying 11 items.
- On the computational complexity of path cover problems (Q799105) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- Finding and listing induced paths and cycles (Q1941391) (← links)
- On the computational complexity of length- and neighborhood-constrained path problems (Q2294439) (← links)
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract) (Q2817625) (← links)
- The even-path problem for graphs and digraphs (Q3345793) (← links)
- On the length of simplex paths: The assignment case (Q3698637) (← links)
- On the average length of lexicographic paths (Q3735459) (← links)
- (Q4026306) (← links)
- On the difficulty of finding walks of length k (Q4385673) (← links)
- Simple paths with exact and forbidden lengths (Q4562938) (← links)
