{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T00:23:48Z","timestamp":1610670228559},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1982,7]]},"DOI":"10.1145\/322326.322328","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:26:10Z","timestamp":1027769170000},"page":"623-641","source":"Crossref","is-referenced-by-count":184,"title":["Linear-time computability of combinatorial problems on series-parallel graphs"],"prefix":"10.1145","volume":"29","author":[{"given":"K.","family":"Takamizawa","sequence":"first","affiliation":[{"name":"C & C Laboratories, Nippon Electric Co Ltd, Kawasaki, Japan 213"}]},{"given":"T.","family":"Nishizeki","sequence":"additional","affiliation":[{"name":"Department of Electrical Communications, Tohoku University, Sendai, Japan 980"}]},{"given":"N.","family":"Saito","sequence":"additional","affiliation":[{"name":"Department of Electrical Communications, Tohoku University, Sendai, Japan 980"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_2","unstructured":"AHO A V HOPCROFT J E AND ULLMAN J D The Design and Analysis of Computer Algorzthms. Addison-Wesley Reading Mass. 1974 AHO A V HOPCROFT J E AND ULLMAN J D The Design and Analysis of Computer Algorzthms. Addison-Wesley Reading Mass. 1974"},{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(79)90160-2","article-title":"Polytope des mdependants d'un graphe series-parallel","volume":"27","author":"BOULALA M","year":"1979","journal-title":"Discrete Math"},{"key":"e_1_2_1_3_2","unstructured":"CHARTRAND G GELLER D AND HEI)ETNIEMI S Graphs with forbidden subgraphs J Combmatorial Theory 10 (1971) 12-41 CHARTRAND G GELLER D AND HEI)ETNIEMI S Graphs with forbidden subgraphs J Combmatorial Theory 10 (1971) 12-41","DOI":"10.1016\/0095-8956(71)90065-7","doi-asserted-by":"crossref"},{"key":"e_1_2_1_4_2","first-page":"303","article-title":"Topology of series-parallel networks","volume":"10","author":"DUFFIN R J","year":"1965","journal-title":"J Math Apphc"},{"key":"e_1_2_1_5_2","unstructured":"EDMONOS J. Paths trees and flowers. Canad d Math. 17 (1965) 449-467. EDMONOS J. Paths trees and flowers. Canad d Math. 17 (1965) 449-467."},{"key":"e_1_2_1_6_2","author":"KARIV","first-page":"100","year":"1975","volume-title":"Proc 16th IEEE Syrup on Foundations of Computer Science"},{"key":"e_1_2_1_7_2","first-page":"237","article-title":"NP-complete graph problems. Theor","volume":"1","author":"GA EY","year":"1976","journal-title":"Comput Scl."},{"key":"e_1_2_1_8_2","unstructured":"HADLOCK F.O Fmdlng a maximum cut of a planar graph in polynomial ume SIAM J Comput. 4 (1975) 221-225 HADLOCK F.O Fmdlng a maximum cut of a planar graph in polynomial ume SIAM J Comput. 4 (1975) 221-225"},{"key":"e_1_2_1_9_2","unstructured":"HARARY F Graph Theory Addison-Wesley Readmg Mass. 1969 HARARY F Graph Theory Addison-Wesley Readmg Mass. 1969","DOI":"10.21236\/AD0705364","doi-asserted-by":"crossref"},{"key":"e_1_2_1_10_2","first-page":"3","article-title":"Dividing a graph into tnconnected components","volume":"2","author":"HOPCROFT J E","year":"1973","journal-title":"SlAM Z Compul."},{"key":"e_1_2_1_11_2","unstructured":"HEDETNIEMI S T Hereditary properties of graphs J Combinatorial Theory B 14 (1973) 94-99 HEDETNIEMI S T Hereditary properties of graphs J Combinatorial Theory B 14 (1973) 94-99","DOI":"10.1016\/S0095-8956(73)80009-7","doi-asserted-by":"crossref"},{"key":"e_1_2_1_13_2","author":"KIRKPATRICK D G","first-page":"240","year":"1978","volume-title":"Proc 10th ACM Symp on Theory of Computing"},{"key":"e_1_2_1_14_2","unstructured":"KR1SHNAMOORTIIY M S AND DEo N.Node-deletion NP-complete problems SlAM J. Comput. 8 4 (197_9) 619-625. KR1SHNAMOORTIIY M S AND DEo N.Node-deletion NP-complete problems SlAM J. Comput. 8 4 (197_9) 619-625.","DOI":"10.1137\/0208049","doi-asserted-by":"crossref"},{"key":"e_1_2_1_15_2","author":"LEWIS JM","first-page":"265","year":"1978","volume-title":"Proc 10th ACM Symp on Theory of Computing"},{"key":"e_1_2_1_16_2","unstructured":"MONMA C L AND SIDNEY J B.Sequencing with series-parallel procedure constraints Tech Rep 347 School of Operations Research and Industrial Engineering Cornell Umv Ithaca N.Y 1979. MONMA C L AND SIDNEY J B.Sequencing with series-parallel procedure constraints Tech Rep 347 School of Operations Research and Industrial Engineering Cornell Umv Ithaca N.Y 1979."},{"key":"e_1_2_1_17_2","unstructured":"MOORE E F. AND SHANNON C E Reliable orcmts using rehable relays I-II J Frankhn 1nat 262 3 (1956) 191 and 4 (1956) 281 MOORE E F. AND SHANNON C E Reliable orcmts using rehable relays I-II J Frankhn 1nat 262 3 (1956) 191 and 4 (1956) 281"},{"key":"e_1_2_1_18_2","unstructured":"NlsrtlZliK1 T A~D SAJTO N Necessary and su~ctent condmon for a graph to be three-terminal series-parallel-cascade J Combinatorial Theory B 24 3 (1978) 344-361 NlsrtlZliK1 T A~D SAJTO N Necessary and su~ctent condmon for a graph to be three-terminal series-parallel-cascade J Combinatorial Theory B 24 3 (1978) 344-361","DOI":"10.1016\/0095-8956(78)90054-0","doi-asserted-by":"crossref"},{"key":"e_1_2_1_19_2","first-page":"3","article-title":"for detecting series-parallel graphs and D-charts","volume":"59","author":"NISHIZEKI T","year":"1976","journal-title":"Trans Inst Elect Commun. Eng Japan"},{"key":"e_1_2_1_20_2","unstructured":"TOMIZAWA N.\n \n \n \n On a speoahzauon sequence from general matrolds to ladder graphs with special emphasis on the characterization of ladder matroids. RAAG Research Notes Third Series 191 Research Assoc of Applied Geometry Tokyo Japan 1973\n . TOMIZAWA N. On a speoahzauon sequence from general matrolds to ladder graphs with special emphasis on the characterization of ladder matroids. RAAG Research Notes Third Series 191 Research Assoc of Applied Geometry Tokyo Japan 1973."},{"key":"e_1_2_1_21_2","author":"VALDES J.","first-page":"1","year":"1979","volume-title":"Proc I l th Ann ACM Symp on Theory of Computing, Atlanta, Ga"},{"key":"e_1_2_1_22_2","author":"WATANABE T","first-page":"78","year":"1979","article-title":"the node cover problem of planar graphs Proc of 1979 hit Symp on Ctrcmts and Systems, Tokyo","journal-title":"Japan"},{"key":"e_1_2_1_23_2","author":"YANNAKAKIS M","first-page":"253","year":"1978","volume-title":"San Diego"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=322328&ftid=6379&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T07:37:49Z","timestamp":1599809869000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,7]]},"references-count":22,"journal-issue":{"published-print":{"date-parts":[[1982,7]]},"issue":"3"},"alternative-id":["10.1145\/322326.322328"],"URL":"http:\/\/dx.doi.org\/10.1145\/322326.322328","relation":{"cites":[]},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":["Control and Systems Engineering","Hardware and Architecture","Software","Artificial Intelligence","Information Systems"]}}