{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:30Z","timestamp":1725535830003},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020285"},{"type":"electronic","value":"9783642020292"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02029-2_16","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T14:12:39Z","timestamp":1248703959000},"page":"158-171","source":"Crossref","is-referenced-by-count":0,"title":["O(m logn) Split Decomposition of Strongly Connected Graphs"],"prefix":"10.1007","author":[{"given":"Benson L.","family":"Joeris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Lundberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ross M.","family":"McConnell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Bouchet, A.: Digraph decompositions and eulerian systems. SIAM Journal on Algebraic and Discrete Methods\u00a08 (1987)","DOI":"10.1137\/0608028"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W.H. Cunningham","year":"1982","unstructured":"Cunningham, W.H.: Decomposition of directed graphs. SIAM J. Algebraic Discrete Methods\u00a03, 214\u2013228 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E. Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering, and applications to split decomposition and parity graph recognition. Journal of Algorithms\u00a036, 205\u2013240 (2000)","journal-title":"Journal of Algorithms"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/65950.65951","volume":"36","author":"C.P. Gabor","year":"1989","unstructured":"Gabor, C.P., Supowit, K.J., Hsu, W.-L.: Recognizing circle graphs in polynomial time. Journal of the ACM\u00a036, 435\u2013473 (1989)","journal-title":"Journal of the ACM"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1006\/jagm.1994.1007","volume":"16","author":"T.H. Ma","year":"1994","unstructured":"Ma, T.H., Spinrad, J.: An O(n 2) algorithm for undirected split decomposition. Journal of Algorithms\u00a016, 145\u2013160 (1994)","journal-title":"Journal of Algorithms"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF02022041","volume":"4","author":"R.H. M\u00f6hring","year":"1985","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions. Annals of Operations Research\u00a04, 195\u2013225 (1985)","journal-title":"Annals of Operations Research"},{"key":"16_CR8","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics\u00a019, 257\u2013356 (1984)","journal-title":"Annals of Discrete Mathematics"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Rao, M.: Solving some NP-complete problems using split decomposition. Discrete Applied Mathematics (2007)","DOI":"10.1016\/j.dam.2007.11.013"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1137\/0402051","volume":"2","author":"J. Spinrad","year":"1989","unstructured":"Spinrad, J.: Prime testing for the split decomposition of a graph. SIAM Journal on Discrete Mathematics\u00a02, 590\u2013599 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"16_CR11","unstructured":"Spinrad, J.P.: Two Dimensional Partial Orders. Ph.D thesis, Princeton University (1982)"},{"key":"16_CR12","unstructured":"Spinrad, J.P.: Graph partitioning (1985) (unpublished manuscript)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"J.P. Spinrad","year":"1985","unstructured":"Spinrad, J.P.: On comparability and permutation graphs. Siam J. Comput.\u00a014, 658\u2013670 (1985)","journal-title":"Siam J. Comput."},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/BFb0036947","volume-title":"Proceedings of the 10th Colloquium on Automata, Languages and Programming","author":"J.P. Spinrad","year":"1983","unstructured":"Spinrad, J.P., Valdes, J.: Recognition and isomorphism of two-dimensional partial orders. In: Proceedings of the 10th Colloquium on Automata, Languages and Programming. LNCS, pp. 676\u2013686. Springer, Berlin (1983)"}],"container-title":["Lecture Notes in Computer Science","Graph Theory, Computational Intelligence and Thought"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02029-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T18:18:39Z","timestamp":1558462719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02029-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020285","9783642020292"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02029-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}