On longest paths in digraphs
From MaRDI portal
Recommendations
Cited in
(13)- Notes on oriented depth-first search and longest paths
- A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs
- Paths and cycles in extended and decomposable digraphs
- On the longest circuit in an alterable digraph
- Small-m method for detecting all longest paths
- scientific article; zbMATH DE number 3912415 (Why is no real title available?)
- scientific article; zbMATH DE number 3914345 (Why is no real title available?)
- Heuristics for finding a maximum number of disjoint bounded paths
- scientific article; zbMATH DE number 3947999 (Why is no real title available?)
- scientific article; zbMATH DE number 3974318 (Why is no real title available?)
- scientific article; zbMATH DE number 4004210 (Why is no real title available?)
- scientific article; zbMATH DE number 166489 (Why is no real title available?)
- On legal path problems in digraphs
This page was built for publication: On longest paths in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718747)