(en) Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph (Seffi) Naor et Baruch Schieber, « A unified approach to approximating resource allocation and scheduling », Journal of the ACM, vol. 48, no 5, , p. 1069-1090 (DOI10.1145/502102.502107, lire en ligne)
colostate.edu
cs.colostate.edu
(en) Habib, Michel; McConnell, Ross; Paul, Christophe; Viennot, Laurent, « Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition, and consecutive ones testing », Theor. Comput. Sci., vol. 234, , p. 59–84 (DOI10.1016/S0304-3975(97)00241-7, lire en ligne)
doi.org
dx.doi.org
(en) Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph (Seffi) Naor et Baruch Schieber, « A unified approach to approximating resource allocation and scheduling », Journal of the ACM, vol. 48, no 5, , p. 1069-1090 (DOI10.1145/502102.502107, lire en ligne)
(en) Peisen Zhang, Eric A. Schon, Stuart G. Fischer, Eftihia Cayanis, Janie Weiss, Susan Kistler et Philip E. Bourne, « An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA », Bioinformatics, vol. 10, no 3, , p. 309-317 (DOI10.1093/bioinformatics/10.3.309)
Jürgen Eckhoff, « Extremal interval graphs », Journal of Graph Theory, vol. 17, no 1, , p. 117–127 (DOI10.1002/jgt.3190170112).
(en) Habib, Michel; McConnell, Ross; Paul, Christophe; Viennot, Laurent, « Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition, and consecutive ones testing », Theor. Comput. Sci., vol. 234, , p. 59–84 (DOI10.1016/S0304-3975(97)00241-7, lire en ligne)
Kellogg S. Booth et George S. Lueker, « A linear time algorithm for deciding interval graph isomorphism », Journal of the ACM, vol. 26, no 2, , p. 183-195 (DOI10.1145/322123.322125).
