{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:24:53Z","timestamp":1726410293089},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540716143"},{"type":"electronic","value":"9783540716150"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71615-0_12","type":"book-chapter","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T18:51:34Z","timestamp":1176922294000},"page":"130-141","source":"Crossref","is-referenced-by-count":0,"title":["Generation of Tree Decompositions by Iterated Local Search"],"prefix":"10.1007","author":[{"given":"Nysret","family":"Musliu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth.\u00a08, 277\u2013284 (1987)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: Discovering treewidth. Technical Report UU-CS-2005-018, Utrecht University (2005)","DOI":"10.1007\/978-3-540-30577-4_1"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1051\/ro:2004011","volume":"38","author":"F. Clautiaux","year":"2004","unstructured":"Clautiaux, F., Moukrim, A., N\u00e9gre, S., Carlier, J.: Heuristic and meta-heurisistic methods for computing graph treewidth. RAIRO Oper. Res.\u00a038, 13\u201326 (2004)","journal-title":"RAIRO Oper. Res."},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific Journal of Mathematics\u00a015, 835\u2013855 (1965)","journal-title":"Pacific Journal of Mathematics"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum coloring cliques and maximum independent set of a chordal graph. SIAM J. Comput.\u00a01, 180\u2013187 (1972)","journal-title":"SIAM J. Comput."},{"key":"12_CR6","unstructured":"Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence, UAI-04, pp. 201\u2013208 (2004)"},{"key":"12_CR7","unstructured":"Johnson, D.S., Trick, M.A.: The second dimacs implementation challenge: Np-hard problems: Maximum clique, graph coloring, and satisfiability. Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society (1993)"},{"key":"12_CR8","first-page":"2","volume":"1","author":"U. Kjaerulff","year":"1992","unstructured":"Kjaerulff, U.: Optimal decomposition of probabilistic networks by simulated annealing. Statistics and Computing\u00a01, 2\u201317 (1992)","journal-title":"Statistics and Computing"},{"key":"12_CR9","volume-title":"Electronic Notes in Discrete Mathematics 8","author":"A. Koster","year":"2001","unstructured":"Koster, A., Bodlaender, H., van Hoesel, S.: Treewidth: Computational experiments. In: Electronic Notes in Discrete Mathematics 8, Elsevier Science Publishers, Amsterdam (2001)"},{"issue":"1","key":"12_CR10","first-page":"1997","volume":"7","author":"P. Larranaga","year":"1991","unstructured":"Larranaga, P., Kujipers, C.M.H, Poza, M., Murga, R.H.: Decomposing bayesian networks: triangulation of the moral graph with genetic algorithms. Statistics and Computing (UK)\u00a07(1), 1997 (1991)","journal-title":"Statistics and Computing (UK)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. ii. algorithmic aspects of tree-width. Journal Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal Algorithms"},{"key":"12_CR12","unstructured":"Shoikhet, K., Geiger, D.: A practical algorithm for finding optimal triangulations. In: Proc. of National Conference on Artificial Intelligence (AAAI\u201997), pp. 185\u2013190 (1997)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithm to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput.\u00a013, 566\u2013579 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71615-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T11:16:31Z","timestamp":1556363791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71615-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540716143","9783540716150"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71615-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}