{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T09:17:20Z","timestamp":1778577440462,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11065,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["YSE(A) 56750231"],"award-info":[{"award-number":["YSE(A) 56750231"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1983,4]]},"DOI":"10.1016\/0022-0000(83)90012-0","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"197-208","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":38,"title":["Edge-contraction problems"],"prefix":"10.1016","volume":"26","author":[{"given":"Takao","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomio","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90012-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(83)90012-0_BIB2","article-title":"Necessary and Sufficient Conditions for a property on Graphs to be Characterized in Terms of Forbidden Graphs","author":"Asano","year":"1982"},{"key":"10.1016\/0022-0000(83)90012-0_BIB3","article-title":"Edge-deletion problems","author":"Asano","year":"1982"},{"key":"10.1016\/0022-0000(83)90012-0_BIB4","series-title":"Proc. Third Annual ACM Symp. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(83)90012-0_BIB5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours, and the Chinese postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0022-0000(83)90012-0_BIB6","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\/0022-0000(83)90012-0_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(83)90012-0_BIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","article-title":"Finding a maximum cut of a planar graph in polynomial time","volume":"4","author":"Hadlock","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90012-0_BIB9","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0022-0000(83)90012-0_BIB10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90012-0_BIB11","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90012-0_BIB12","series-title":"Complexity of Computer Computation","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(83)90012-0_BIB13","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the computational complexity of combinatorial problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0022-0000(83)90012-0_BIB14","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1137\/0208049","article-title":"Node-deletion NP-complete problems","volume":"8","author":"Krishnamoorthy","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90012-0_BIB15","series-title":"Proc. 10th Annual ACM Symp. on Theory of Computing","first-page":"265","article-title":"On the complexity of the maximum subgraph problem","author":"Lewis","year":"1978"},{"key":"10.1016\/0022-0000(83)90012-0_BIB16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","article-title":"The node-deletion problem for hereditary properties is NP-complete","volume":"20","author":"Lewis","year":"1980","journal-title":"J. Comput. Sys. Sci."},{"key":"10.1016\/0022-0000(83)90012-0_BIB17","series-title":"Connectivity in Graphs","author":"Tutte","year":"1966"},{"key":"10.1016\/0022-0000(83)90012-0_BIB18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(81)90039-1","article-title":"On the removal of forbidden graphs by edge-deletion or edge-contraction","volume":"3","author":"Watanabe","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0022-0000(83)90012-0_BIB19","series-title":"Proc. 10th Annual ACM Symp. on Theory of Computing","first-page":"253","article-title":"Node- and edge-deletion NP-complete problems","author":"Yannakakis","year":"1978"},{"key":"10.1016\/0022-0000(83)90012-0_BIB20","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1145\/322154.322157","article-title":"The effect of a connectivity requirement on the complexity of maximum subgraph problems","volume":"26","author":"Yannakakis","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90012-0_BIB21","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","article-title":"Edge-deletion problems","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90012-0_BIB22","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1137\/0210022","article-title":"Node-deletion problems on bipartite graphs","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900120?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900120?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:10:52Z","timestamp":1757095852000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,4]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,4]]}},"alternative-id":["0022000083900120"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90012-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Edge-contraction problems","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(83)90012-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1983 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}