EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 28 / No 6 (1994) RAIRO-Theor. Inf. Appl., 28 6 (1994) 567-582 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 28, Number 6, 1994
Page(s) 567 - 582
DOI https://doi.org/10.1051/ita/1994280605671
Published online 01 February 2017
  1. 1. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, The design and Analysis of Computer Algorithms, Addision Wesley, Reading MA., 1974. [MR: 413592] [Zbl: 0326.68005] [Google Scholar]
  2. 2. M. GAREY and D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman & Company, San Fransisco, 1979. [MR: 519066] [Zbl: 0411.68039] [Google Scholar]
  3. 3. A. ITAI, C. H. PAPADIMITRIOU and J. SZWARCFITER, Hamilton paths in grid graphs, SIAM J. Computing, November 1982, 11, 4, pp. 676-686. [MR: 677661] [Zbl: 0506.05043] [Google Scholar]
  4. 4. R. M. KARP and V. RAMACHANDRAN, A survey of parallel algorithms for shared-memory machines, Technical Report CSD 88/408, UCB, 1988. [Zbl: 0900.68267] [Google Scholar]
  5. 5. D. ANGLUIN and L. VALIANT, Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings, J. Computer Syst., 1979, 18, pp. 155-193. [MR: 532174] [Zbl: 0437.05040] [Google Scholar]
  6. 6. C. BERGE, Graphs and Hypergraphs, North-Holland-American Elsevier, 1973. [MR: 357172] [Zbl: 0254.05101] [Google Scholar]
  7. 7. B. BOLLOBAS, Extremal Graph Theory, Academic Press, London 1978. [MR: 506522] [Zbl: 0419.05031] [Google Scholar]
  8. 8. A. M. FRIEZE, Parallel Algorithms for finding Hamiltonian Cycles in Random Graphs, Information Processing Letters, 1987, 25, pp. 111-117. [MR: 896153] [Zbl: 0653.68071] [Google Scholar]
  9. 9. D. SOROKER, Fast Parallel Algorithms for finding Hamiltonian Paths and Cycles in a Tournament, Technical Report No. UCB/CSD 87/309, University of California, Berkeley 1986. [Zbl: 0644.05036] [MR: 936110] [Google Scholar]
  10. 10. E. DAHLHAUS, P. HAJNAL and M. KARPINSKI, Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs, Proceedings 29th IEEE FOCS, 1988, pp. 186-193. [Google Scholar]
  11. 11. J. SILVESTER and L. KLEINROCK, On the Capacity of Multihop slottee ALOHA Networks with Regular Structure, IEEE Transactions on Communications, COM-31, August 1983, pp. 974-982. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.