Author:
Bang-Jensen J.,El Haddad M.,Manoussakis Y.,Przytycka T. M.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference23 articles.
1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm,J. Algorithms,10 (1989), 287–302.
2. R. J. Anderson and G. L. Miller, Deterministic parallel list ranking,Proc. 3rd Egean Workshop on Computing, 1988, pp. 81–90.
3. E. Bampis, M. El Haddad, Y. Manoussakis, and M. Santha, A parallel reduction of hamilton cycle to hamilton path in tournaments,J. Algorithms,19 (1995), 432–440.
4. J. Bang-Jensen, Arc-local tournament digraphs: a generalization of tournaments and bipartite tournaments, submitted.
5. J. Bang-Jensen, G. Gutin, and J. Huang, A sufficient condition for a complete multipartite digraph to be hamiltonian,Discrete Math., to appear.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献