{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:28Z","timestamp":1725662848391},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540107040"},{"type":"electronic","value":"9783540386612"}],"license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10704-5_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:14:47Z","timestamp":1330172087000},"page":"79-94","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorial problems on series-parallel graphs"],"prefix":"10.1007","author":[{"given":"K.","family":"Takamizawa","sequence":"first","affiliation":[]},{"given":"T.","family":"Nishizeki","sequence":"additional","affiliation":[]},{"given":"N.","family":"Saito","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"8_CR1","unstructured":"A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. 1974."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(79)90160-2","volume":"27","author":"M. Boulala","year":"1979","unstructured":"M. Boulala and J. Uhry, Polytope des independants d'un graphe series-parallel, Discrete Math., 27, pp. 225\u2013243 (1979).","journal-title":"Discrete Math."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0095-8956(71)90065-7","volume":"10","author":"G. Chartrand","year":"1971","unstructured":"G. Chartrand, D. Geller and S. Hedetniemi, Graphs with forbidden subgraphs, J. of Combinatorial Theory, 10, pp. 12\u201341 (1971).","journal-title":"J. of Combinatorial Theory"},{"key":"8_CR4","first-page":"303","volume":"10","author":"R. J. Duffin","year":"1965","unstructured":"R. J. Duffin, Topology of series parallel networks, J. Math. and Appli. 10, pp. 303\u2013318 (1965).","journal-title":"J. Math. and Appli."},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Paths, trees, and flowers, Canad. Math. 17, pp. 449\u2013467 (1965).","journal-title":"Canad. Math."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"S. Even and O. Kariv, An O(n2.5) algorithm for maximum matching in general graphs, Proc. IEEE 16th Symp. on FOCS, pp. 100\u2013112 (1975).","DOI":"10.1109\/SFCS.1975.5"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Science, 1, pp. 237\u2013267 (1976).","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"8_CR8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput., 2, 3, pp. 135\u2013158 (1973).","journal-title":"SIAM J. Comput."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F. O. Hadlock","year":"1975","unstructured":"F. O. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput., 4, pp. 221\u2013225 (1975).","journal-title":"SIAM J. Comput."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"F. Harary, Graph Theory, Addison-Wesley, Reading, Mass. 1969.","DOI":"10.21236\/AD0705364"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/S0095-8956(73)80009-7","volume":"14","author":"S. T. Hedetniemi","year":"1973","unstructured":"S. T. Hedetniemi, Hereditary properties of graphs, J. Combinatorial Theory (B), 14, pp. 94\u201399 (1973).","journal-title":"J. Combinatorial Theory (B)"},{"issue":"4","key":"8_CR12","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1137\/0208049","volume":"8","author":"M. S. Krishnamoorthy","year":"1979","unstructured":"M. S. Krishnamoorthy and N. Deo, Node-deletion NP-complete problems, SIAM J. Comput., 8, 4, pp. 619\u2013625 (1979).","journal-title":"SIAM J. Comput."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"D. G. Kirkpatrick and P. Hell, On the completeness of a generalized matching problem, Proc. 10th ACM Symp. on Theory of Computing (1978).","DOI":"10.1145\/800133.804353"},{"key":"8_CR14","unstructured":"T. Kikuno, N. Yoshida and Y. Kakuda, Dominating set in planar graphs, Tech. Report AL79-9, Inst. Elect. Commun. Eng. Japan, pp. 21\u201330 (1979)."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"J. M. Lewis, On the complexity of the maximum subgraph problem, Proc. of the 10th ACM Symp. on Theory of Computing, pp. 265\u2013274 (1978).","DOI":"10.1145\/800133.804356"},{"key":"8_CR16","unstructured":"C. L. Monma and J. B. Sidney, Sequencing with series-parallel procedure constraints, TR 347, Sch. of OR\/IE, Cornell University (1979)."},{"issue":"3","key":"8_CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","volume":"262","author":"E. F. Moore","year":"1956","unstructured":"E. F. Moore and C. E. Shannon, Reliable circuits using reliable relays I\u2013II, J. Franklin Inst., 262, 3, p. 191, and 4, p. 281 (1956).","journal-title":"J. Franklin Inst."},{"issue":"3","key":"8_CR18","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/0095-8956(78)90054-0","volume":"24","author":"T. Nishizeki","year":"1978","unstructured":"T. Nishizeki and N. Saito, Necessary and sufficient condition for a graph to be three-terminal series-parallel-cascade, J. of Combinatorial Theory B, 24, 3, pp. 344\u2013361 (1978).","journal-title":"J. of Combinatorial Theory B"},{"issue":"3","key":"8_CR19","first-page":"259","volume":"59","author":"T. Nishizeki","year":"1976","unstructured":"T. Nishizeki, K. Takamizawa and N. Saito, Algorithms for detecting series-parallel graphs and D-charts, Trans. of Inst. Elect. Commun. Eng. Japan, 59, 3, pp. 259\u2013260 (1976).","journal-title":"Trans. of Inst. Elect. Commun. Eng. Japan"},{"key":"8_CR20","unstructured":"N. Tomizawa, On a specialization sequence from general matroids to ladder graphs with special emphasis on the characterization of ladder matroids, RAAG Research Notes, Third Series, No. 191 (1973)."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"J. Valdes, R. E. Tarjan and E. L. Lawler, The recognition of series-parallel digraph, Proc. of 11th Ann. ACM Symp. on Theory of Computing, 1979.","DOI":"10.1145\/800135.804393"},{"key":"8_CR22","unstructured":"T. Watanabe, T. Ae and A. Nakamura, On the node cover problem of planar graphs, Proc. of 1979 ISCAS, pp. 78\u201381 (1979)."},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"M. Yannakakis, Node-and edge-deletion NP-complete problems, Proc of the 10th ACM Symp. on Theory of Computing, pp. 253\u2013264 (1978).","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Graph Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10704-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T07:56:32Z","timestamp":1558252592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10704-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540107040","9783540386612"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-10704-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}