{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:02Z","timestamp":1725455582790},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0024485","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"25-37","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the separable-homogeneous decomposition of graphs"],"prefix":"10.1007","author":[{"given":"Luitpold","family":"Babel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Olariu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Babel L., Olariu, S.: On the isomorphism of graphs with few Pos. Graph-Theoretic Concepts in Computer Science, 21th International Workshop, WG'95, Lecture Notes in Computer Science 1017 Springer, Berlin, 1995, 24\u201336","DOI":"10.1007\/3-540-60618-1_63"},{"key":"4_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam, 1976"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/322123.322125","volume":"26","author":"K.S. Booth","year":"1979","unstructured":"Booth, K.S., Lueker, G.S.: A linear time algorithm for deciding interval graph isomorphism. Journal of the ACM\n26 (1979) 183\u2013195","journal-title":"Journal of the ACM"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics\n3 (1981) 163\u2013174","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Cournier, A., Habib, M.: A new linear time algorithm for modular decomposition. Trees in Algebra and Programming, Lecture Notes in Computer Science 787 Springer, 1994, 68\u201384","DOI":"10.1007\/BFb0017474"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/sapm198981179","volume":"81","author":"B. Jamison","year":"1989","unstructured":"Jamison, B., Olariu, S.: P\n4-reducible graphs, a class of uniquely tree representable graphs. Studies in Applied Mathematics\n81 (1989) 79\u201387","journal-title":"Studies in Applied Mathematics"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(91)90085-B","volume":"34","author":"B. Jamison","year":"1991","unstructured":"Jamison, B., Olariu, S.: On a unique tree representation for P\n4-extendible graphs. Discrete Applied Mathematics\n34 (1991) 151\u2013164","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","volume":"35","author":"B. Jamison","year":"1992","unstructured":"Jamison, B., Olariu, S.: A unique tree representation for P\n4-sparse graphs. Discrete Applied Mathematics\n35 (1992) 115\u2013129","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/S0895480191196812","volume":"8","author":"B. Jamison","year":"1995","unstructured":"Jamison, B., Olariu, S.: p-components and the homogeneous decomposition of graphs. SIAM Journal of Discrete Mathematics\n8 (1995) 448\u2013463","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1137\/0603025","volume":"3","author":"M.M. Klawe","year":"1982","unstructured":"Klawe, M.M., Corneil, D.G., Proskurowski, A.: Isomorphism testing in hook-up graphs. SIAM Journal on Algebraic and Discrete Methods\n3 (1982) 260\u2013274","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"4_CR11","first-page":"3","volume":"81","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Graphical algorithms and their complexity. Math. Center Tracts\n81 (1976) 3\u201332","journal-title":"Math. Center Tracts"},{"key":"4_CR12","unstructured":"Lin, R., Olariu, S.: A fast parallel algorithm to recognize P\n4-sparse graphs. Submitted"},{"key":"4_CR13","unstructured":"McConnell, R., Spinrad, J.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. Fifth Annual ACM-SIAM Symposium of Discrete Algorithms, 1994, 536\u2013545"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. Graphs and Orders, Dordrecht, Holland, 1985","DOI":"10.1007\/978-94-009-5315-4_2"},{"key":"4_CR15","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Rademacher, F.J.: Substitution decomposition and connections with combinatorial optimization. Annals of Discrete Mathematics\n19 (1984) 257\u2013356","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T04:30:05Z","timestamp":1578544205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024485"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0024485","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}