no. 5
On the difficulty of finding walks of length k
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 5, pp. 429-435. 
@article{ITA_1997__31_5_429_0,
     author = {Basagni, S. and Bruschi, D. and Ravasio, F.},
     title = {On the difficulty of finding walks of length k},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {429--435},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {5},
     year = {1997},
     mrnumber = {1611647},
     zbl = {0893.68072},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1997__31_5_429_0/}
}
TY  - JOUR
AU  - Basagni, S.
AU  - Bruschi, D.
AU  - Ravasio, F.
TI  - On the difficulty of finding walks of length k
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1997
SP  - 429
EP  - 435
VL  - 31
IS  - 5
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1997__31_5_429_0/
LA  - en
ID  - ITA_1997__31_5_429_0
ER  - 
%0 Journal Article
%A Basagni, S.
%A Bruschi, D.
%A Ravasio, F.
%T On the difficulty of finding walks of length k
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1997
%P 429-435
%V 31
%N 5
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1997__31_5_429_0/
%G en
%F ITA_1997__31_5_429_0
Basagni, S.; Bruschi, D.; Ravasio, F. On the difficulty of finding walks of length k. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 5, pp. 429-435. http://archive.numdam.org/item/ITA_1997__31_5_429_0/

1. N. Alon, R. Yuster and U. Zwick, Color-coding, Journal of the ACM, 1995, 42, 4, pp. 844-856. | MR | Zbl

2. F. Barahona and W. R. Pulleyblank, Exact arborescences, matchings and cycles. Discrete Applied Mathematics, 1987, 16, pp. 91-99. | MR | Zbl

3. D. Bruschi and F. Ravasio, Random parallel algorithms for findings cycles, branchings and perfect matchings. Algorithmica, 1995, 13, 4, pp. 346-356. | Zbl

4. P. M. Camerini, G. Galbiati and F. Maffioli, Random pseudo-polynomial algorithms for exacts matroid problems. Journal of Algorithms, 1992, 13, 2, pp. 258-273. | Zbl

5. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, MIT Press and McGraw-Hill, 1990. | Zbl

6. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979. | Zbl

7. Y. Han, V. Pan and J. Reif, Efficient parallel algorithms for computing all pair shortest paths in directed graphs. In Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, 1992, pp. 353-362.

8. A. Kaufmann, Graphs, dynamic programming and finite games. Academic Press, New York, 1967. Translation of v. 2 of Methodes et modèles de la recherche. | Zbl

9. E. L. Lawler, Combinatorial Optimization: Networks and Matroids. Holt Rinehart and Winston, New York, 1976. | MR | Zbl

10. C. H. Papadimitriou and M. Yannakakis, The complexity of restricted spanning tree problems. Journal of the ACM, 1982, 29, 2, pp. 285-309. | MR | Zbl

11. W. Tutte. Graph Theory, Addison-Wesley, Reading, MA, 1984. | MR