{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:47Z","timestamp":1725487127797},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424215"},{"type":"electronic","value":"9783540446293"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44629-x_18","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T14:09:20Z","timestamp":1183385360000},"page":"294-308","source":"Crossref","is-referenced-by-count":0,"title":["Graph Colouring by Maximal Evidence Edge Adding"],"prefix":"10.1007","author":[{"given":"Barry","family":"Rising","sequence":"first","affiliation":[]},{"given":"John","family":"Shawe-Taylor","sequence":"additional","affiliation":[]},{"given":"Janez","family":"\u017derovnik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: The Reactive Tabu Search. ORSA J. Comput. 6 (1994) 126\u2013140","journal-title":"ORSA J. Comput"},{"key":"18_CR2","first-page":"449","volume":"2","author":"P. Burge","year":"1995","unstructured":"Burge, P., Shawe-Taylor, J.: Adapting the Energy Landscape for MFA. J. Artif. Neural Networks 2 (1995) 449\u2013454","journal-title":"J. Artif. Neural Networks"},{"key":"18_CR3","first-page":"443","volume":"2","author":"P. Burge","year":"1995","unstructured":"Burge, P., Shawe-Taylor, J.: Bitstream Neurons for Graph Colouring. J. Artif. Neural Networks 2 (1995) 443\u2013448","journal-title":"J. Artif. Neural Networks"},{"key":"18_CR4","unstructured":"Burke, D.K., Elliman, D.G., Weare, R.F.: A University Timetabling System Based on Graph Colouring and Constraint Manipulation. J. Res. Comput. Ed. 26 (1993)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/4235.752921","volume":"3","author":"E. Burke","year":"1999","unstructured":"Burke, E., Newall, J.: A Multi-stage Evolutionary Algorithm for the Timetabling Problem. IEEE Trans. Evol. Comput. 3 (1999) 63\u201374","journal-title":"IEEE Trans. Evol. Comput"},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","first-page":"3","volume-title":"Recent Developments in Practical Course Timetabling","author":"M.W. Carter","year":"1996","unstructured":"Carter, M.W., G. Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E., Ross, P. (eds): Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 3\u201321"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Chams, M., Hertz, A., de Werra, D.: Some Experiments with Simulated Annealing for Colouring Graphs. Eur. J. Oper. Res. 32 260\u2013266","DOI":"10.1016\/S0377-2217(87)80148-0"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A Measure of Asymptotic Efficiency of Tests of a Hypothesis Based on the Sum of Observations. Ann. Math. Stat. 23 (1952) 493\u2013507","journal-title":"Ann. Math. Stat."},{"key":"18_CR9","unstructured":"Culberson, J.C.: Iterated Greedy Graph Coloring and the Difficulty Landscape. Technical Report TR 92-07, University of Alberta, Canada (1992) ( http:\/\/web.cs.ualberta.ca\/~joe\/index.html\/ )"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. Werra","year":"1985","unstructured":"de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19 (1985) 151\u2013162","journal-title":"Eur. J. Oper. Res"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(86)90184-2","volume":"43","author":"K. Edwards","year":"1986","unstructured":"Edwards, K.: The Complexity of Colouring Problems on Dense Graphs. Theor. Comput. Sci. 43 (1986) 337\u2013343","journal-title":"Theor. Comput. Sci"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1009638304510","volume":"4","author":"A.E. d. Eiben","year":"1998","unstructured":"Eiben, A.E., van der Havl, J.K., van Hemert, J.I.: Graph Coloring with Adaptive Evolutionary Algorithms. J. Heuristics 4 (1998) 25\u201346","journal-title":"J. Heuristics"},{"key":"18_CR13","unstructured":"Erben, W.: A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling. Proc. 3rd Int. Conf. on the Practice and Theory of Automated Timetabling (2000) 397\u2013421"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(93)90275-Z","volume":"25","author":"A.G. Ferreira","year":"1993","unstructured":"Ferreira, A.G., J. \u017derovnik, J.: Bounding the Probability of Success of Stochastic Methods for Global Optimization. J. Comput. Math. Appl. 25 (1993) 1\u20138","journal-title":"J. Comput. Math. Appl."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.A.: Genetic and Hybrid Algorithms for Graph Coloring. Ann. Oper. Res. 63 (1996) 437\u2013461","journal-title":"Ann. Oper. Res"},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","volume":"23","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S.: The Complexity of Near-Optimal Graph Colouring. J. Assoc. Comput. Machinery 23 (1976) 43\u201349","journal-title":"J. Assoc. Comput. Machinery"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some Simplified NP-complete Graph Problems. Theor. Comput. Sci. 1 (1976) 237\u2013267","journal-title":"Theor. Comput. Sci"},{"key":"18_CR18","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco, CA (1979)"},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu Search-Part I. ORSA J. Comput. 1 (1989) 190\u2013206","journal-title":"ORSA J. Comput"},{"key":"18_CR20","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu Search-Part II. ORSA J. Comput. 2 (1990) 4\u201332","journal-title":"ORSA J. Comput"},{"key":"18_CR21","first-page":"378","volume":"39","author":"A. Hertz","year":"1991","unstructured":"Hertz, A., de Werra, D.: Using Tabu Search Techniques for Graph Coloring. Computing 39 (1991) 378\u2013406","journal-title":"Computing"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. Johnson","year":"1991","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by Simulated Annealing: an Experimental Evaluation. II: Graph Coloring and Number Partitioning. Oper. Res. 39 (1991) 378\u2013406","journal-title":"Oper. Res"},{"key":"18_CR23","unstructured":"Johnson, D.S., Trick, M. (eds.): Cliques, Coloring and Satisfiability: 2nd DIMACS Implementation Challenge. American Mathematical Society (1996). DIMACS colouring benchmarks available via ftp at ftp:\/\/ftp.rutgers.dimacs.edu"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirckpatrick","year":"1983","unstructured":"Kirckpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulation Annealing. Science 220 (1983) 671\u2013680","journal-title":"Science"},{"key":"18_CR25","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F.T. Leighton","year":"1979","unstructured":"Leighton, F.T.: A Graph Coloring Algorithm for Large Scheduling Problems. J. Res. Natl Bur. Standards 84 (1979) 489\u2013506","journal-title":"J. Res. Natl Bur. Standards"},{"key":"18_CR26","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yanakakis, M.: On the Hardness of Approximating Minimization Problems. J. Assoc. Comput. Machinery 41 (1994) 960\u2013981","journal-title":"J. Assoc. Comput. Machinery"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/361082.361092","volume":"17","author":"G.A. Neufeld","year":"1974","unstructured":"Neufeld, G.A., Tartar, J.: Graph Coloring Conditions for the Existence of Solutions to the Timetable Problem. Commun. ACM 17 (1974) 450\u2013453","journal-title":"Commun. ACM"},{"key":"18_CR28","first-page":"479","volume-title":"The Theory and Applications of Graphs","author":"R.J. Opsut","year":"1981","unstructured":"Opsut, R.J., Roberts, F.S.: On the Fleet Maintenance, Mobile Radio Frequency, Task Assignment and Traffic Phasing Problems. In: Chatrand, G., Alavi, Y., Goldsmith, D.L., Lesniak-Foster, L., Lick, D.R. (eds.): The Theory and Applications of Graphs. Wiley, New York (1981) 479\u2013492"},{"key":"18_CR29","first-page":"995","volume":"1","author":"C. Peterson","year":"1987","unstructured":"Peterson, C., Anderson, J.R.: A Mean Field Annealing Theory Learning Algorithm for Neural Networks. Int. J. Neural Systems 1 (1987) 995\u20131019","journal-title":"Int. J. Neural Systems"},{"key":"18_CR30","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(89)90214-8","volume":"74","author":"A. Petford","year":"1989","unstructured":"Petford, A., Welsh, D.: A Randomised 3-colouring Algorithm. Discrete Math. 74 (1989) 253\u2013261","journal-title":"Discrete Math."},{"key":"18_CR31","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A.: A Survey of Automated Timetabling. Artif. Intell. Rev. 13 (1999) 87\u2013127","journal-title":"Artif. Intell. Rev."},{"key":"18_CR32","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1093\/comjnl\/23.4.307","volume":"23","author":"G. Schmidt","year":"1979","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Timetable Construction-an Annotated Bibliography. Comput. J. 23 (1979) 307\u2013316","journal-title":"Comput. J."},{"key":"18_CR33","first-page":"391","volume":"1","author":"J. Shawe-Taylor","year":"1992","unstructured":"Shawe-Taylor, J., \u017derovnik, J.: Boltzmann Machine with Finite Alphabet. In: Artificial Neural Networks 2, Vol. 1. Int. Conf. on Artif. Neural Networks (Brighton) (1992) 391\u2013394.","journal-title":"Artificial Neural Networks 2"},{"key":"18_CR34","first-page":"329","volume":"2","author":"J. Shawe-Taylor","year":"1995","unstructured":"Shawe-Taylor, J., \u017derovnik, J.: Analysis of the Mean Field Annealing Algorithm for Graph Colouring. J. Artif. Neural Networks 2 (1995) 329\u2013340","journal-title":"J. Artif. Neural Networks"},{"key":"18_CR35","unstructured":"Shawe-Taylor, J., \u017derovnik, J.: Adapting Temperature for some Randomized Local Search Algorithms. Preprint 614. Dept Math., University of Ljubljana (1998)"},{"key":"18_CR36","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D.J.A. Welsh","year":"1967","unstructured":"Welsh, D.J.A., Powell, M.B.: An Upper Bound for the Chromatic Number of a Graph and its Applications to Timetabling Problems. Comput. J. 10 (1967) 85\u201386","journal-title":"Comput. J."},{"key":"18_CR37","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1093\/comjnl\/11.1.41","volume":"11","author":"D.C. Wood","year":"1968","unstructured":"Wood, D.C.: A System for Computing University Examination Timetables. Comput. J. 11 (1968) 41\u201347","journal-title":"Comput. J."},{"key":"18_CR38","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0020-0190(89)90144-0","volume":"33","author":"J. \u017derovnik","year":"1989","unstructured":"\u017derovnik, J.: A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph. Inform. Process. Lett. 33 (1989) 213\u2013219","journal-title":"Inform. Process. Lett"},{"key":"18_CR39","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0012-365X(94)90402-2","volume":"131","author":"J. \u017derovnik","year":"1994","unstructured":"\u017derovnik, J.: A Randomized Algorithm for k-colorability. Discrete Math. 131 (1994) 379\u2013393","journal-title":"Discrete Math."},{"key":"18_CR40","first-page":"59","volume":"17","author":"J. \u017derovnik","year":"1993","unstructured":"\u017derovnik, J.: Regular Graphs are \u201cDifficult\u201d for Colouring. Informatica 17 (1993) 59\u201363","journal-title":"Informatica"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling III"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44629-X_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:39:01Z","timestamp":1556573941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44629-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424215","9783540446293"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/3-540-44629-x_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}