{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:18Z","timestamp":1725600438262},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22685-4_30","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T08:54:39Z","timestamp":1312966479000},"page":"331-342","source":"Crossref","is-referenced-by-count":0,"title":["A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition"],"prefix":"10.1007","author":[{"given":"Binh-Minh","family":"Bui-Xuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Meister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Bern\u00e1th, A.: A note on the directed source location algorithm. Technical report, TR-2004-12, Egerv\u00e1ry Research Group, Budapest (2004)"},{"key":"30_CR2","unstructured":"Bui-Xuan, B.-M.: Tree-representation of set families in graph decompositions and efficient algorithms. PhD thesis, University of Montpellier II (2008)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-78773-0_43","volume-title":"LATIN 2008: Theoretical Informatics","author":"B.-M. Bui-Xuan","year":"2008","unstructured":"Bui-Xuan, B.-M., Habib, M.: A representation theorem for union-difference families and application. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 492\u2013503. Springer, Heidelberg (2008)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1016\/j.dam.2008.11.001","volume":"157","author":"B.-M. Bui-Xuan","year":"2009","unstructured":"Bui-Xuan, B.-M., Habib, M., Limouzy, V., de Montgolfier, F.: Algorithmic Aspects of a General Modular Decomposition Theory. Discrete Applied Mathematics\u00a0157, 1993\u20132009 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Bui-Xuan, B.-M., Habib, M., Rao, M.: Tree-representation of set families and applications to combinatorial decompositions. European Journal of Combinatorics (to appear)","DOI":"10.1016\/j.ejc.2011.09.032"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M. Chein","year":"1981","unstructured":"Chein, M., Habib, M., Maurer, M.-C.: Partitive hypergraphs. Discrete Mathematics\u00a037, 35\u201350 (1981)","journal-title":"Discrete Mathematics"},{"key":"30_CR7","unstructured":"Cunningham, W.: A combinatorial decomposition theory. PhD thesis, University of Waterloo (1973)"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"734","DOI":"10.4153\/CJM-1980-057-7","volume":"32","author":"W. Cunningham","year":"1980","unstructured":"Cunningham, W., Edmonds, J.: A combinatorial decomposition theory. Canadian Journal of Mathematics\u00a032, 734\u2013765 (1980)","journal-title":"Canadian Journal of Mathematics"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"2","author":"W. Cunningham","year":"1982","unstructured":"Cunningham, W.: Decomposition of directed graphs. SIAM Journal on Algebraic and Discrete Methods\u00a02, 214\u2013228 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"30_CR10","unstructured":"Dinitz, E., Karzanov, A., Lomonosov, M.: On the structure of a family of minimal weighted cuts in a graph. In: Pridman, A. (ed.) Studies in Discrete Optimization, Nauka, Moscow, pp. 290\u2013306 (1976)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Annals of Discrete Mathematics\u00a01, 185\u2013204 (1977)","journal-title":"Annals of Discrete Mathematics"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1006\/jagm.1995.1022","volume":"18","author":"H. Gabow","year":"1995","unstructured":"Gabow, H.: Centroids, Representations, and Submoduar Flows. Journal of Algorithms\u00a018, 586\u2013628 (1995)","journal-title":"Journal of Algorithms"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/65950.65951","volume":"36","author":"W.-L. Hsu","year":"1989","unstructured":"Hsu, W.-L., Gabor, C., Supowit, K.: Recognizing circle graphs in polynomial time. Journal of the ACM\u00a036, 435\u2013473 (1989)","journal-title":"Journal of the ACM"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.endm.2005.06.039","volume":"22","author":"F. Mongolfier de","year":"2005","unstructured":"de Mongolfier, F., Rao, M.: The bi-join decomposition. Electronic Notes in Discrete Mathematics\u00a022, 173\u2013177 (2005)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"30_CR15","first-page":"3","volume":"82","author":"M. Queyranne","year":"1998","unstructured":"Queyranne, M.: Minimizing symmetric submodular functions. Mathematical Programming\u00a082, 3\u201312 (1998)","journal-title":"Mathematical Programming"},{"key":"30_CR16","volume-title":"Combinatorial Optimization \u2013 Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization \u2013 Polyhedra and Efficiency. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T03:05:37Z","timestamp":1539313537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}