Algoritmo de Coffman-Graham (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Algoritmo de Coffman-Graham" in Spanish language version.

refsWebsite

Global rank Spanish rank

12doi.org

2^nd place

10ams.org

451^st place

1,294^th place

1ucsd.edu

1,933^rd place

1,730^th place

1jstor.org

26^th place

56^th place

ams.org

Coffman, E. G., Jr.; Graham, R. L. (1972), «Optimal scheduling for two-processor systems», Acta Informatica 1: 200-213, MR 0334913, doi:10.1007/bf00288685 ..
Lam, Shui; Sethi, Ravi (1977), «Worst case analysis of two scheduling algorithms», SIAM Journal on Computing 6 (3): 518-536, MR 0496614, doi:10.1137/0206037 ..
Braschi, Bertrand; Trystram, Denis (1994), «A new insight into the Coffman–Graham algorithm», SIAM Journal on Computing 23 (3): 662-669, MR 1274650, doi:10.1137/S0097539790181889 ..
Sugiyama, Kozo; Tagawa, Shôjirô; Toda, Mitsuhiko (1981), «Methods for visual understanding of hierarchical system structures», IEEE Transactions on Systems, Man, and Cybernetics, SMC-11 (2): 109-125, MR 0611436, doi:10.1109/TSMC.1981.4308636 ..
Healy, Patrick; Nikolov, Nikola S. (2002), «How to layer a directed acyclic graph», Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria, September 23–26, 2001, Revised Papers, Lecture Notes in Computer Science 2265, Springer-Verlag, pp. 16-30, MR 1962416, doi:10.1007/3-540-45848-4_2 ..
Chardon, Marc; Moukrim, Aziz (2005), «The Coffman-Graham algorithm optimally solves UET task systems with overinterval orders», SIAM Journal on Discrete Mathematics 19 (1): 109-121, MR 2178187, doi:10.1137/S0895480101394999 ..
Coffman, E. G., Jr.; Sethuraman, J.; Timkovsky, V. G. (2003), «Ideal preemptive schedules on two processors», Acta Informatica 39 (8): 597-612, MR 1996238, doi:10.1007/s00236-003-0119-6 ..
Lenstra, J. K.; Rinnooy Kan, A. H. G. (1978), «Complexity of scheduling under precedence constraints», Operations Research 26 (1): 22-35, JSTOR 169889, MR 0462553, doi:10.1287/opre.26.1.22 ..
Sethi, Ravi (1976), «Scheduling graphs on two processors», SIAM Journal on Computing 5 (1): 73-82, MR 0398156, doi:10.1137/0205005 ..
Gabow, Harold N.; Tarjan, Robert Endre (1985), «A linear-time algorithm for a special case of disjoint set union», Journal of Computer and System Sciences 30 (2): 209-221, MR 801823, doi:10.1016/0022-0000(85)90014-5 ..

doi.org

dx.doi.org

Coffman, E. G., Jr.; Graham, R. L. (1972), «Optimal scheduling for two-processor systems», Acta Informatica 1: 200-213, MR 0334913, doi:10.1007/bf00288685 ..
Lam, Shui; Sethi, Ravi (1977), «Worst case analysis of two scheduling algorithms», SIAM Journal on Computing 6 (3): 518-536, MR 0496614, doi:10.1137/0206037 ..
Braschi, Bertrand; Trystram, Denis (1994), «A new insight into the Coffman–Graham algorithm», SIAM Journal on Computing 23 (3): 662-669, MR 1274650, doi:10.1137/S0097539790181889 ..
Sugiyama, Kozo; Tagawa, Shôjirô; Toda, Mitsuhiko (1981), «Methods for visual understanding of hierarchical system structures», IEEE Transactions on Systems, Man, and Cybernetics, SMC-11 (2): 109-125, MR 0611436, doi:10.1109/TSMC.1981.4308636 ..
Bastert, Oliver; Matuszewski, Christian (2001), «Layered drawings of digraphs», en Kaufmann, Michael; Wagner, Dorothea, eds., Drawing Graphs: Methods and Models, Lecture Notes in Computer Science 2025, Springer-Verlag, pp. 87-120, doi:10.1007/3-540-44969-8_5 .. Bastert and Matuszewski also include a description of the Coffman–Graham algorithm; however, they omit the transitive reduction stage of the algorithm.
Healy, Patrick; Nikolov, Nikola S. (2002), «How to layer a directed acyclic graph», Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria, September 23–26, 2001, Revised Papers, Lecture Notes in Computer Science 2265, Springer-Verlag, pp. 16-30, MR 1962416, doi:10.1007/3-540-45848-4_2 ..
Muntz, R. R.; Coffman, E. G. (1969), «Optimal preemptive scheduling on two-processor systems», IEEE Transactions on Computers 18: 1014-1020, doi:10.1109/T-C.1969.222573 ..
Chardon, Marc; Moukrim, Aziz (2005), «The Coffman-Graham algorithm optimally solves UET task systems with overinterval orders», SIAM Journal on Discrete Mathematics 19 (1): 109-121, MR 2178187, doi:10.1137/S0895480101394999 ..
Coffman, E. G., Jr.; Sethuraman, J.; Timkovsky, V. G. (2003), «Ideal preemptive schedules on two processors», Acta Informatica 39 (8): 597-612, MR 1996238, doi:10.1007/s00236-003-0119-6 ..
Lenstra, J. K.; Rinnooy Kan, A. H. G. (1978), «Complexity of scheduling under precedence constraints», Operations Research 26 (1): 22-35, JSTOR 169889, MR 0462553, doi:10.1287/opre.26.1.22 ..
Sethi, Ravi (1976), «Scheduling graphs on two processors», SIAM Journal on Computing 5 (1): 73-82, MR 0398156, doi:10.1137/0205005 ..
Gabow, Harold N.; Tarjan, Robert Endre (1985), «A linear-time algorithm for a special case of disjoint set union», Journal of Computer and System Sciences 30 (2): 209-221, MR 801823, doi:10.1016/0022-0000(85)90014-5 ..

jstor.org

Lenstra, J. K.; Rinnooy Kan, A. H. G. (1978), «Complexity of scheduling under precedence constraints», Operations Research 26 (1): 22-35, JSTOR 169889, MR 0462553, doi:10.1287/opre.26.1.22 ..

ucsd.edu

math.ucsd.edu

Coffman, E. G., Jr.; Graham, R. L. (1972), «Optimal scheduling for two-processor systems», Acta Informatica 1: 200-213, MR 0334913, doi:10.1007/bf00288685 ..