{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:23Z","timestamp":1725542063340},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_111","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T07:03:43Z","timestamp":1259910223000},"page":"1104-1113","source":"Crossref","is-referenced-by-count":3,"title":["Random Generation and Enumeration of Bipartite Permutation Graphs"],"prefix":"10.1007","author":[{"given":"Toshiki","family":"Saitoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuhisa","family":"Yamanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"111_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(98)00310-0","volume":"201","author":"K.P. Bogart","year":"1999","unstructured":"Bogart, K.P., West, D.B.: A short proof that \u2018proper=unit\u2019. Disc. Math.\u00a0201, 21\u201323 (1999)","journal-title":"Disc. Math."},{"key":"111_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)"},{"key":"111_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.3230110103","volume":"11","author":"C.J. Colbourn","year":"1981","unstructured":"Colbourn, C.J.: On Testing Isomorphism of Permutation Graphs. Networks\u00a011, 13\u201321 (1981)","journal-title":"Networks"},{"issue":"2","key":"111_CR4","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1137\/S0097539792269095","volume":"25","author":"X. Deng","year":"1996","unstructured":"Deng, X., Hell, P., Huang, J.: Linear-time Representation Algorithms for Proper Circular-arc Graphs and Proper Interval Graphs. SIAM J. on Comp.\u00a025(2), 390\u2013403 (1996)","journal-title":"SIAM J. on Comp."},{"issue":"3","key":"111_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/S0012-365X(02)00341-2","volume":"256","author":"E. Deutsch","year":"2002","unstructured":"Deutsch, E., Shapiro, L.W.: A bijection between ordered trees and 2-Motzkin paths and its many consequences. Disc. Math.\u00a0256(3), 655\u2013670 (2002)","journal-title":"Disc. Math."},{"key":"111_CR6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-540-27801-6_12","volume-title":"Combinatorial Pattern Matching","author":"R. Geary","year":"2004","unstructured":"Geary, R., Rahman, N., Raman, R., Raman, V.: A Simple Optimal Representation for Balanced Parentheses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004, vol.\u00a03109, pp. 159\u2013172. Springer, Heidelberg (2004)"},{"key":"111_CR7","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Disc. Math.\u00a057 (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"111_CR8","volume-title":"Concrete Mathematics","author":"R.L. Graham","year":"1989","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley Publishing Company, Reading (1989)"},{"issue":"21","key":"111_CR9","doi-asserted-by":"publisher","first-page":"2628","DOI":"10.1016\/j.disc.2006.11.014","volume":"307","author":"Y. Koh","year":"2007","unstructured":"Koh, Y., Ree, S.: Connected permutation graphs. Disc. Math.\u00a0307(21), 2628\u20132635 (2007)","journal-title":"Disc. Math."},{"issue":"3","key":"111_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0020-0190(02)00240-5","volume":"84","author":"S.i. Nakano","year":"2002","unstructured":"Nakano, S.i.: Efficient generation of plane trees. IPL\u00a084(3), 167\u2013172 (2002)","journal-title":"IPL"},{"issue":"3","key":"111_CR11","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s11390-009-9242-3","volume":"24","author":"R. S.-i. Nakano","year":"2009","unstructured":"S.-i. Nakano, R.: A new approach to graph recognition and applications to distance-hereditary graphs. J. of Computer Science and Technology\u00a024(3), 517\u2013533 (2009)","journal-title":"J. of Computer Science and Technology"},{"key":"111_CR12","series-title":"Fascicle 4 of The Art of Computer Programming","volume-title":"Generating All Trees, History of Combinatorial Generation","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: Generating All Trees, History of Combinatorial Generation. Fascicle 4 of The Art of Computer Programming, vol.\u00a0\u00a04. Addison-Wesley Publishing Company, Reading (2005)"},{"issue":"2","key":"111_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/322123.322125","volume":"26","author":"G.S. Lueker","year":"1979","unstructured":"Lueker, G.S., Booth, K.S.: A Linear Time Algorithm for Deciding Interval Graph Isomorphism. J. of the ACM\u00a026(2), 183\u2013195 (1979)","journal-title":"J. of the ACM"},{"key":"111_CR14","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V.: Succinct Representation of Balanced Parentheses and Static Trees. SIAM J. on Comp.\u00a031, 762\u2013776 (2001)","journal-title":"SIAM J. on Comp."},{"key":"111_CR15","first-page":"139","volume-title":"Proof Techniques in Graph Theory","author":"F.S. Roberts","year":"1969","unstructured":"Roberts, F.S.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139\u2013146. Academic Press, London (1969)"},{"key":"111_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-00202-1_16","volume-title":"WALCOM: Algorithms and Computation","author":"T. Saitoh","year":"2009","unstructured":"Saitoh, T., Yamanaka, K., Kiyomi, M., Uehara, R.: Random Generation and Enumeration of Proper Interval Graphs. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol.\u00a05431, pp. 177\u2013189. Springer, Heidelberg (2009)"},{"key":"111_CR17","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations. AMS (2003)","DOI":"10.1090\/fim\/019"},{"key":"111_CR18","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative Combinatorics, Cambridge, vol.\u00a01 (1997)","DOI":"10.1017\/CBO9780511805967"},{"key":"111_CR19","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative Combinatorics, Cambridge, vol.\u00a0\u00a02 (1999)","DOI":"10.1017\/CBO9780511609589"},{"issue":"3","key":"111_CR20","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.dam.2004.06.008","volume":"145","author":"R. Uehara","year":"2004","unstructured":"Uehara, R., Toda, S., Nagoya, T.: Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs. Disc. App. Math.\u00a0145(3), 479\u2013482 (2004)","journal-title":"Disc. App. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_111.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:32:08Z","timestamp":1606185128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_111","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}