Registro:

Referencias:

• Alon, N., A note on the decomposition of graphs into isomorphic matchings (1983) Acta Mathematica Hungarica, 42, pp. 221-223
• Baker, B.S., Coffman, E.G., Mutual exclusion scheduling (1996) Theoretical Computer Science, 162, pp. 225-243
• Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J., (2001) Scheduling Computer and Manufacturing Processes, , second ed, Springer, Berlin
• Bodlaender, H.L., Fomin, F.V., Equitable colorings of bounded treewidth graphs (2005) Theoretical Computer Science, 349 (1), pp. 22-30
• Bodlaender, H.L., Jansen, K., Onthe complexity of scheduling in compatible jobs withunit-times (1993) Lecture Notes in Computer Science, 711, pp. 291-300
• Bodlaender, H.L., Jansen, K., Restrictions of graph partition problems, Part I (1995) Theoretical Computer Science, 148, pp. 93-109
• Brandstädt, A., On improved time bounds for permutation graph problems (1992) Lecture Notes in Computer Science, 657, pp. 1-10
• Casazza, M., Ceselli, A., Nunkesser, M., Efficient algorithms for the double traveling salesman problem with multiple stacks (2009) Proceedings of the 8th Cologne-twente Workshop on Graphs and Combinatorial Optimization, pp. 7-10. , Paris S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti, (Eds.)
• Chen, B.-L., Ko, M.-T., Lih, K.-W., Equitable and m-bounded coloring of split graphs (1996) Lecture Notes in Computer Science, 1120, pp. 1-5
• Cohen, E., Tarsi, M., NP-completeness of graph decomposition problems (1991) Journal of Complexity, 7 (2), pp. 200-212
• Dushnik, B., Miller, E., Partially ordered sets (1941) American Journal of Mathematics, 63, pp. 600-610
• Felipe, A., Ortuño, M.T., Tirado, G., The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (2009) Computers & Operations Research, 36 (11), pp. 2983-2993
• Felipe, A., Ortuño, M.T., Tirado, G., New neighborhood structures for the double traveling Salesman problem with multiple stacks (2009) Top, 17, pp. 190-213
• Gilmore, P.C., Hoffman, A.J., A characterization of comparability graphs and of interval graphs (1964) Canadian Journal of Mathematics, 16, pp. 539-548
• Golumbic, M., The complexity of comparability graph recognition and coloring (1977) Computing, 18, pp. 199-208
• Hajnal, A., Szemerédi, E., Proof of a conjectureof P. Erdos (1970) Combinatorial Theory and its Applications, 2, pp. 601-623. , P. Erdos, A. Rényi, V. Sós (Eds.) North-Holland, Amsterdam
• Hansen, P., Hertz, A., Kuplinsky, J., Bounded vertex colorings of graphs (1993) Discrete Mathematics, 111, pp. 305-312
• Irani, S., Leung, V., Scheduling with conflicts, and applications to traffic signal control (1996) Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 85-94
• Jansen, K., The mutual exclusion scheduling problem for permutation and comparability graphs (2003) Information and Computation, 180, pp. 71-81
• Jarvis, M., Zhou, B., Bounded vertex coloring of trees (2001) Discrete Mathematics, 232, pp. 145-151
• Kaller, D., Gupta, A., Shermer, T., The Xt-coloring problem (1995) Lecture Notes in Computer Science, 900, pp. 409-420
• Kitagawa, F., Ikeda, H., An existential problem of a weight-controlled subset and its application to school timetable construction (1988) Discrete Mathematics, 72, pp. 195-211
• Krarup, J., De Werra, D., Chromatic optimisation: Limitations, objectives, uses, references (1982) European Journal of Operational Research, 11, pp. 1-19
• Lonc, Z., On complexity of some chain and antichain partition problems (1992) Lecture Notes in Computer Science, 570, pp. 97-104
• Lusby, R., Larsen, J., Ehrgott, M., Ryan, D., An exact method for the double TSP with multiple stacks (2009) Tech. Report 2.2009, Department of Management Engineering, , Technical University of Denmark
• Mannino, C., Oriolo, G., Ricci, F., Chandran, S., The stable set problem and the thinness of a graph (2007) Operations Research Letters, 35, pp. 1-9
• McConnell, R.M., Spinrad, J.P., Linear-time transitive orientation (1997) Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 19-25
• Meyer, W., Equitable coloring (1973) The American Mathematical Monthly, 80 (8), pp. 920-922
• Petersen, H.L., Archetti, C., Speranza, M.G., Exact solutions to the double travelling salesman problem with multiple stacks (2010) Networks, 56 (4), pp. 229-243
• Petersen, H.L., Madsen, O.B.G., The double travelling salesman problem with multiple stacks-formulation and heuristic solution approaches (2009) European Journal of Operational Research, 198 (1), pp. 139-147
• Pnueli, A., Lempel, A., Even, S., Transitive orientation of graphs and identification of permutation graphs (1971) Canadian Journal of Mathematics, 23, pp. 160-175
• Smith, B.F., Bjørstad, P.E., Gropp, W.D., (1996) Domain Decomposition. Parallel Multilevel Methods for Elliptic Partial Differential Equations, , Cambridge University Press, Cambridge

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------