{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:55Z","timestamp":1725543115604},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_7","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"42-51","source":"Crossref","is-referenced-by-count":0,"title":["On Indecomposability Preserving Elimination Sequences"],"prefix":"10.1007","author":[{"given":"Chandan K.","family":"Dubey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashank K.","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-36379-3_8","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Cournier","year":"2002","unstructured":"Cournier, A.: Search in indecomposable graphs. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 80\u201391. Springer, Heidelberg (2002)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","first-page":"212","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Cournier","year":"1993","unstructured":"Cournier, A., Habib, M.: An efficient algorithm to recognize prime undirected graphs. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol.\u00a0657, pp. 212\u2013224. Springer, Heidelberg (1993)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0017474","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"A. Cournier","year":"1994","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 68\u201384. Springer, Heidelberg (1994)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0012-365X(97)00077-0","volume":"183","author":"A. Cournier","year":"1998","unstructured":"Cournier, A., Ille, P.: Minimal indecomposable graphs. Discrete Mathematics\u00a0183, 61\u201380 (1998)","journal-title":"Discrete Mathematics"},{"key":"7_CR5","first-page":"315","volume":"22","author":"C.K. Dubey","year":"2005","unstructured":"Dubey, C.K., Mehta, S.K.: Some algorithms on conditionally critical indecomposable graphs. ENDM\u00a022, 315\u2013319 (2005)","journal-title":"ENDM"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/11533719_70","volume-title":"Computing and Combinatorics","author":"C.K. Dubey","year":"2005","unstructured":"Dubey, C.K., Mehta, S.K., Deogun, J.S.: Conditionally critical indecomposable graphs. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 690\u2013700. Springer, Heidelberg (2005)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Fra\u00efss\u00e9, R.: L\u2019intervalle en th\u00e9orie des relations, ses g\u00e9n\u00e9ralizations, filtre intervallire et cl\u00f4ture d\u2019une relation. In: Orders, Description and Roles, vol. 6, pp. 313\u2013342. North-Holland, Amsterdam (1984)","DOI":"10.1016\/S0304-0208(08)73829-5"},{"key":"7_CR8","unstructured":"Habib, M.: Substitution des structures combinatoires, th\u00e9orie et algorithmes. Ph.D. Thesis, Universit\u00e9 Pierre et Marie Curie, Paris VI (1981)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0012-365X(96)00097-0","volume":"173","author":"P. Ille","year":"1997","unstructured":"Ille, P.: Indecomposable graphs. Discrete Mathematics\u00a0173, 71\u201378 (1997)","journal-title":"Discrete Mathematics"},{"key":"7_CR10","unstructured":"McConnell, R.M., Spinrad, J.P.: Linear-time modular decomposition and efficient transitive orientation of comparability graphs. In: SODA, pp. 535\u2013545 (1994)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/moor.8.2.170","volume":"8","author":"R.H. Mohring","year":"1983","unstructured":"Mohring, R.H., Buer, H.A.: A fast algorithm for the decomposition of graphs and posets. Math. Oper. Res.\u00a08, 170\u2013184 (1983)","journal-title":"Math. Oper. Res."},{"key":"7_CR12","first-page":"257","volume":"19","author":"R.H. Mohring","year":"1984","unstructured":"Mohring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Ann. Discrete Mathematics\u00a019, 257\u2013356 (1984)","journal-title":"Ann. Discrete Mathematics"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"629","DOI":"10.2307\/1998445","volume":"266","author":"J.H. Schmerl","year":"1981","unstructured":"Schmerl, J.H.: Arborescent structures, ii: interpretability in the theory of trees. Transactions of the American Mathematical Scoiety\u00a0266, 629\u2013643 (1981)","journal-title":"Transactions of the American Mathematical Scoiety"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(93)90516-V","volume":"113","author":"J.H. Schmerl","year":"1993","unstructured":"Schmerl, J.H., Trotter, W.T.: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. Discrete Mathematics\u00a0113, 191\u2013205 (1993)","journal-title":"Discrete Mathematics"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(92)90180-I","volume":"39","author":"J. Spinrad","year":"1992","unstructured":"Spinrad, J.: p4-trees and substitution decomposition. Discrete Applied Math.\u00a039, 263\u2013291 (1992)","journal-title":"Discrete Applied Math."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0012-365X(73)90100-3","volume":"6","author":"D.P. Sumner","year":"1973","unstructured":"Sumner, D.P.: Graphs indecomposable with respect to the x-join. Discrete Mathematics\u00a06, 281\u2013298 (1973)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:47Z","timestamp":1605644027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11809678_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}