{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:44:56Z","timestamp":1743065096498,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207112"},{"type":"electronic","value":"9783642207129"}],"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-20712-9_35","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:05:22Z","timestamp":1307750722000},"page":"443-455","source":"Crossref","is-referenced-by-count":0,"title":["Recognizing Sparse Perfect Elimination Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Matthijs","family":"Bomhoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/B978-1-4832-3187-7.50018-0","volume-title":"Graph Theory and Computing","author":"D.J. Rose","year":"1972","unstructured":"Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Read, R.C. (ed.) Graph Theory and Computing, pp. 183\u2013217. Academic Press, New York (1972)"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/0202018","volume":"2","author":"L. Haskins","year":"1973","unstructured":"Haskins, L., Rose, D.J.: Toward Characterization of Perfect Elimination Digraphs. SIAM J. Comput.\u00a02, 217\u2013224 (1973)","journal-title":"SIAM J. Comput."},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/0203022","volume":"3","author":"D.J. Kleitman","year":"1974","unstructured":"Kleitman, D.J.: A Note on Perfect Elimination Digraphs. SIAM J. Comput.\u00a03, 280\u2013282 (1974)","journal-title":"SIAM J. Comput."},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic Aspects of Vertex Elimination on Graphs. SIAM J. Comput.\u00a05, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1137\/0134014","volume":"34","author":"D.J. Rose","year":"1978","unstructured":"Rose, D.J., Tarjan, R.E.: Algorithmic Aspects of Vertex Elimination on Directed Graphs. SIAM J. Appl. Math.\u00a034, 176\u2013197 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/jgt.3190020209","volume":"2","author":"M.C. Golumbic","year":"1978","unstructured":"Golumbic, M.C., Goss, C.F.: Perfect Elimination and Chordal Bipartite Graphs. J. Graph Theory\u00a02, 155\u2013163 (1978)","journal-title":"J. Graph Theory"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0020-0190(82)90101-6","volume":"15","author":"L. Goh","year":"1982","unstructured":"Goh, L., Rotem, D.: Recognition of perfect elimination bipartite graphs. Inform. Process. Lett.\u00a015, 179\u2013182 (1982)","journal-title":"Inform. Process. Lett."},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0166-218X(03)00295-6","volume":"138","author":"J.P. Spinrad","year":"2004","unstructured":"Spinrad, J.P.: Recognizing quasi-triangulated graphs. Discrete Appl. Math.\u00a0138, 203\u2013213 (2004)","journal-title":"Discrete Appl. Math."},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix Multiplication via Arithmetic Progressions. J. Symbolic Comput.\u00a09, 251\u2013280 (1990)","journal-title":"J. Symbolic Comput."},{"key":"35_CR10","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Publishing Company, Inc., Reading (1994)"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the Minimum Fill-In is NP-Complete. SIAM J. Alg. Disc. Meth.\u00a02, 77\u201379 (1981)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/276698.276710","volume-title":"STOC 1998: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing","author":"A. Natanzon","year":"1998","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: A Polynomial Approximation Algorithm for the Minimum Fill-In Problem. In: STOC 1998: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 41\u201347. ACM, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20712-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T11:57:48Z","timestamp":1553774268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20712-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207112","9783642207129"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20712-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}