{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T14:55:02Z","timestamp":1776696902838,"version":"3.51.2"},"reference-count":84,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,9]]},"DOI":"10.1016\/0196-6774(85)90012-4","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"434-451","source":"Crossref","is-referenced-by-count":238,"title":["The NP-completeness column: an ongoing guide"],"prefix":"10.1016","volume":"6","author":[{"given":"David S","family":"Johnson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90012-4_BIB1","first-page":"73","article-title":"NP-completeness of the Hamiltonian cycle problem for bipartite graphs","volume":"3","author":"Akiyama","year":"1980","journal-title":"J. Information Processing"},{"key":"10.1016\/0196-6774(85)90012-4_BIB2","article-title":"Complexity of finding embeddings in a k-tree","author":"Arnborg","year":"1984"},{"key":"10.1016\/0196-6774(85)90012-4_BIB3","article-title":"Linear time algorithms for NP-hard problems on graphs embedded in k-trees","author":"Arnborg","year":"1984"},{"key":"10.1016\/0196-6774(85)90012-4_BIB4","article-title":"A linear time algorithm for the subgraph homeomorphism problem for the fixed graph K3,3","author":"Asano","year":"1983"},{"key":"10.1016\/0196-6774(85)90012-4_BIB5","article-title":"A polynomial algorithm for the max-cut problem on graphs without sub-graphs homeomorphic to K3,3","author":"Asano","year":"1984"},{"key":"10.1016\/0196-6774(85)90012-4_BIB6","series-title":"Proceedings 24th Ann. Symp. on Foundations of Computer Science","first-page":"265","article-title":"Approximation algorithms for NP-complete problems on planar graphs (Preliminary Version)","author":"Baker","year":"1983"},{"key":"10.1016\/0196-6774(85)90012-4_BIB7","article-title":"On the complexity of max cut","author":"Barahona","year":"1980"},{"key":"10.1016\/0196-6774(85)90012-4_BIB8","series-title":"Balancing signed toroidal graphs in polynomial time","author":"Barahona","year":"1983"},{"key":"10.1016\/0196-6774(85)90012-4_BIB9","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1970"},{"key":"10.1016\/0196-6774(85)90012-4_BIB10","series-title":"Generalized planar matching","author":"Berman","year":"1985"},{"key":"10.1016\/0196-6774(85)90012-4_BIB11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","article-title":"The edge Hamiltonian path problem is NP-complete","volume":"13","author":"Bertossi","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90012-4_BIB12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0020-0190(83)90078-9","article-title":"Finding Hamiltonian circuits in proper interval graphs","volume":"17","author":"Bertossi","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90012-4_BIB13","article-title":"Dominating sets and domatic number of circular arc graphs","author":"Bonuccelli","year":"1980"},{"key":"10.1016\/0196-6774(85)90012-4_BIB14","article-title":"Dominating sets in chordal graphs","author":"Booth","year":"1980"},{"key":"10.1016\/0196-6774(85)90012-4_BIB15","article-title":"Problems polynomially equivalent to graph isomorphism","author":"Booth","year":"1979"},{"key":"10.1016\/0196-6774(85)90012-4_BIB16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","article-title":"Dominating sets in chordal graphs","volume":"11","author":"Booth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90012-4_BIB17","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(85)90012-4_BIB18","article-title":"On the restriction of some NP-complete problems to permutation graphs","author":"Brandst\u00e4dt","year":"1986"},{"key":"10.1016\/0196-6774(85)90012-4_BIB19","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0605034","article-title":"The k-domination and k-stability problems on sunfree chordal graphs","volume":"5","author":"Chang","year":"1984","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/0196-6774(85)90012-4_BIB20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/0606012","article-title":"Covering, packing and generalized perfection","volume":"6","author":"Chang","year":"1985","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/0196-6774(85)90012-4_BIB21","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/net.3230110103","article-title":"On testing isomorphism of permutation graphs","volume":"11","author":"Colbourn","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0196-6774(85)90012-4_BIB22","first-page":"107","article-title":"Dominating cycles in series-parallel graphs","volume":"19A","author":"Colbourn","year":"1985","journal-title":"Ars Combinatorica"},{"key":"10.1016\/0196-6774(85)90012-4_BIB23","series-title":"Permutation graphs: connected domination and Steiner trees","author":"Colbourn","year":"1985"},{"key":"10.1016\/0196-6774(85)90012-4_BIB24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(85)90057-5","article-title":"Solving NP-hard problems in \u2018almost trees\u2019: vertex cover","volume":"10","author":"Coppersmith","year":"1985","journal-title":"Disc. Applied Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB25","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Disc. Applied Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB26","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","article-title":"Clustering and domination in perfect graphs","volume":"9","author":"Corneil","year":"1984","journal-title":"Disc. Applied Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB27","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02591867","article-title":"Halin graphs and the travelling salesman problem","volume":"26","author":"Cornuejols","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0196-6774(85)90012-4_BIB28","article-title":"Fast Turing reductions between problems in NP, Chapter 4: Reductions between NP-complete problems","author":"Dewdney","year":"1983"},{"key":"10.1016\/0196-6774(85)90012-4_BIB29","article-title":"Application of L.P. duality to problems involving independence and domination","author":"Farber","year":"1982"},{"key":"10.1016\/0196-6774(85)90012-4_BIB30","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","article-title":"Independent domination in chordal graphs","volume":"1","author":"Farber","year":"1982","journal-title":"Operations Res. Lett."},{"key":"10.1016\/0196-6774(85)90012-4_BIB31","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB32","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination, and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Disc. Applied Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB33","doi-asserted-by":"crossref","unstructured":"M. Farber and J. M. Keil, Domination in permutation graphs, J. Algorithms, to appear.","DOI":"10.1016\/0196-6774(85)90001-X"},{"key":"10.1016\/0196-6774(85)90012-4_BIB34","series-title":"Proceedings 11th Ann. ACM Symp. on Theory of Computing","first-page":"27","article-title":"On determining the genus of a graph in O(VO(g)) steps","author":"Filotti","year":"1979"},{"key":"10.1016\/0196-6774(85)90012-4_BIB35","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB36","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","article-title":"The complexity of coloring circular arcs and chords","volume":"1","author":"Garey","year":"1980","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/0196-6774(85)90012-4_BIB37","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0196-6774(85)90012-4_BIB38","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","article-title":"A recognition algorithm for the intersection graphs of directed paths in directed trees","volume":"13","author":"Gavril","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB39","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(78)90003-1","article-title":"A recognition algorithm for the intersection graphs of paths in trees","volume":"23","author":"Gavril","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB40","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0196-6774(85)90012-4_BIB41","doi-asserted-by":"crossref","unstructured":"M. C. Golumbic and R. E. Jamison, The edge intersection graphs of paths in a tree, J. Combinatorial Theory Ser. B, to appear.","DOI":"10.1016\/0095-8956(85)90088-7"},{"key":"10.1016\/0196-6774(85)90012-4_BIB42","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0196-6774(85)90012-4_BIB43","series-title":"Polynomial algorithms for perfect graphs","author":"Gr\u00f6tschel","year":"1981"},{"key":"10.1016\/0196-6774(85)90012-4_BIB44","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular-arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0196-6774(85)90012-4_BIB45","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","article-title":"Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem","volume":"5","author":"Gurari","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90012-4_BIB46","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1145\/828.322439","article-title":"Solving NP-hard problems on graphs that are almost trees and an application to facility location problems","volume":"31","author":"Gurevich","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(85)90012-4_BIB47","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0196-6774(85)90012-4_BIB48","article-title":"A linear algorithm for the domination number of a cactus","author":"Hedetniemi","year":"1983"},{"key":"10.1016\/0196-6774(85)90012-4_BIB49","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge coloring","volume":"10","author":"Holyer","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90012-4_BIB50","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0214018","article-title":"Maximum weight clique algorithms for circular-arc graphs and circle graphs","volume":"14","author":"Hsu","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90012-4_BIB51","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamilton paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90012-4_BIB52","series-title":"Graph Theory and Theoretical Physics","first-page":"44","article-title":"Graph theory and crystal physics","author":"Kasteleyn","year":"1967"},{"key":"10.1016\/0196-6774(85)90012-4_BIB53","series-title":"Finding Hamiltonian circuits in interval graphs","author":"Keil","year":"1985"},{"key":"10.1016\/0196-6774(85)90012-4_BIB54","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0166-218X(83)90003-3","article-title":"A linear algorithm for the domination number of a series-parallel graph","volume":"5","author":"Kikuno","year":"1983","journal-title":"Disc. Applied Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB55","unstructured":"F. T. Leighton, private communication (1985)."},{"key":"10.1016\/0196-6774(85)90012-4_BIB56","series-title":"Selected Topics in Graph Theory 2","first-page":"55","article-title":"Perfect graphs","author":"Lov\u00e1sz","year":"1983"},{"key":"10.1016\/0196-6774(85)90012-4_BIB57","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/322123.322125","article-title":"A linear time algorithm for deciding interval graph isomorphism","volume":"26","author":"Lueker","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(85)90012-4_BIB58","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","article-title":"Isomorphism of bounded valence can be tested in polynomial time","volume":"25","author":"Luks","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(85)90012-4_BIB59","series-title":"Efficient algorithms for new problems on interval graphs and interval models","author":"Manacher","year":"1984"},{"key":"10.1016\/0196-6774(85)90012-4_BIB60","first-page":"9","article-title":"Determining the thickness of graphs is NP-hard","volume":"93","author":"Mansfield","year":"1982"},{"key":"10.1016\/0196-6774(85)90012-4_BIB61","series-title":"Proceedings 12th Ann. ACM Symp. on Theory of Computing","first-page":"225","article-title":"Isomorphism testing for graphs of bounded genus","author":"Miller","year":"1980"},{"key":"10.1016\/0196-6774(85)90012-4_BIB62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(83)80047-3","article-title":"Isomorphism of k-contractible graphs: A generalization of bounded valence and bounded genus","volume":"56","author":"Miller","year":"1983","journal-title":"Information and Control"},{"key":"10.1016\/0196-6774(85)90012-4_BIB63","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0196-6774(85)90012-4_BIB64","series-title":"Proceedings 13th Ann. ACM Symp. on Theory of Computing","first-page":"207","article-title":"Bandwidth-constrained NP-complete problems","author":"Monien","year":"1981"},{"key":"10.1016\/0196-6774(85)90012-4_BIB65","series-title":"Intersection graphs of paths in a tree","author":"Monma","year":"1985"},{"key":"10.1016\/0196-6774(85)90012-4_BIB66","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0602012","article-title":"An O(n2) algorithm for coloring proper circular arc graphs","volume":"2","author":"Orlin","year":"1981","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/0196-6774(85)90012-4_BIB67","article-title":"Efficient vertex- and edge-coloring of outerplanar graphs","author":"Proskurowski","year":"1982"},{"key":"10.1016\/0196-6774(85)90012-4_BIB68","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0601042","article-title":"Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time","volume":"1","author":"Saxe","year":"1980","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"10.1016\/0196-6774(85)90012-4_BIB69","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB70","unstructured":"A. Sch\u00e4ffer, private communication (1985)."},{"key":"10.1016\/0196-6774(85)90012-4_BIB71","series-title":"Proceedings 26th Ann. Symp. on Foundations of Computer Science","article-title":"Recognizing circle graphs in polynomial time","author":"Supowit","year":"1985"},{"key":"10.1016\/0196-6774(85)90012-4_BIB72","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(82)90133-5","article-title":"The subgraph isomorphism problem for outerplanar graphs","volume":"17","author":"Syslo","year":"1982","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0196-6774(85)90012-4_BIB73","article-title":"The induced subgraph isomorphism problem for series-parallel graphs is NP-complete","author":"Syslo","year":"1982"},{"key":"10.1016\/0196-6774(85)90012-4_BIB74","series-title":"Proc. WG '83 International Workshop on Graphtheoretic Concepts in Computer Science","first-page":"342","article-title":"NP-complete problems on some tree-structured graphs: a review","author":"Syslo","year":"1983"},{"key":"10.1016\/0196-6774(85)90012-4_BIB75","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","article-title":"Linear-time computability of combinatorial problems on series-parallel graphs","volume":"29","author":"Takamizawa","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(85)90012-4_BIB76","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90012-4_BIB77_1","doi-asserted-by":"crossref","first-page":"535","DOI":"10.2140\/pjm.1971.39.535","article-title":"Matrix characterization of circular-arc graphs","volume":"39","author":"Tucker","year":"1971","journal-title":"Pacific J. Math."},{"key":"10.1016\/0196-6774(85)90012-4_BIB77_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0209001","article-title":"Matrix characterization of circular-arc graphs","volume":"9","author":"Tucker","year":"1971","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90012-4_BIB78","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0209001","article-title":"An efficient test for circular-arc graphs","volume":"9","author":"Tucker","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90012-4_BIB79","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90012-4_BIB80","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0196-6774(85)90012-4_BIB81","series-title":"Proceedings 13th Southeastern Conference on Combinatorics, Graph Theory, and Computing","article-title":"Steiner trees in outerplanar graphs","author":"Wald","year":"1982"},{"key":"10.1016\/0196-6774(85)90012-4_BIB82","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","article-title":"Steiner trees, partial 2-trees, and minimum IFI networks","volume":"13","author":"Wald","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0196-6774(85)90012-4_BIB83","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230150109","article-title":"Steiner trees, connected domination and strongly chordal graphs","volume":"15","author":"White","year":"1985","journal-title":"Networks"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900124?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900124?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:26:00Z","timestamp":1548725160000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":84,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["0196677485900124"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90012-4","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}