EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 27 / No 2 (1993) RAIRO-Theor. Inf. Appl., 27 2 (1993) 85-95 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 27, Number 2, 1993
Page(s) 85 - 95
DOI https://doi.org/10.1051/ita/1993270200851
Published online 01 February 2017
  1. 1. F. AFRATI, Ch. PAPADIMITRIOU and G. PAPAGEORGIOU, Scheduling Dags to Minimize Time and Communication, Aegian Workshop on Computing (AWOC), Corfu, June 1988. [MR: 1017467] [Google Scholar]
  2. 2. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974. [MR: 413592] [Zbl: 0326.68005] [Google Scholar]
  3. 3. S. G. AKL, The Design and Analysis of Parallel Algorithms, Prentice-Hall, 1989. [Zbl: 0754.68053] [Google Scholar]
  4. 4. N. BIGGS, Algebraic Graph Theory, Cambridge University Press, 1974. [MR: 347649] [Zbl: 0284.05101] [Google Scholar]
  5. 5. R. B. BOPPANA, J. HASTAD and S. ZACHOS, Does Co-NP Have Short Interactive Proofs?, Information Processing Letters, Vol. 25, 1987, pp. 27-32. [MR: 896155] [Zbl: 0653.68037] [Google Scholar]
  6. 6. E. G. COFFMAN and P. J. DENNING, Operating Systems Theory, Prentice-Hall, 1973. [Google Scholar]
  7. 7. E. G. COFFMAN (Editor), Computer and Job-shop Scheduling Theory, John Wiley, 1976. [MR: 629691] [Zbl: 0359.90031] [Google Scholar]
  8. 8. M. R. GAREY and D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, 1979. [MR: 519066] [Zbl: 0411.68039] [Google Scholar]
  9. 9. D. K. GOYAL, Scheduling Processor Bound Systems, Report No CS-76-036, Washington State University, 1976. [Google Scholar]
  10. 10. F. HARARY, Graph Theory, Addison-Wesley, 1972. [MR: 256911] [Zbl: 0182.57702] [Google Scholar]
  11. 11. R. M. KARP, A Survey of Parallel Algorithms for Shared-Memory Machines, Report No. UCB/CSD 88/408, University of California Berkeley, March 1988. [Google Scholar]
  12. 12. M. E. LUKS, Isomorphism of Graphs of Bounded Valence Can Be Tested In Polynomial Time, Journal of Computer and System Sciences, Vol. 25, 1982, pp. 42-65. [MR: 685360] [Zbl: 0493.68064] [Google Scholar]
  13. 13. G. SABIDUSSI, Vertex Transitive Graphs, Monatshefte für Mathematik, 68, 1964, pp. 426-438. [EuDML: 177267] [MR: 175815] [Zbl: 0136.44608] [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.