{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:39Z","timestamp":1725525339779},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"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-00202-1_16","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"177-189","source":"Crossref","is-referenced-by-count":2,"title":["Random Generation and Enumeration of Proper Interval Graphs"],"prefix":"10.1007","author":[{"given":"Toshiki","family":"Saitoh","sequence":"first","affiliation":[]},{"given":"Katsuhisa","family":"Yamanaka","sequence":"additional","affiliation":[]},{"given":"Masashi","family":"Kiyomi","sequence":"additional","affiliation":[]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1145\/357084.357091","volume":"2","author":"D.B. Arnold","year":"1980","unstructured":"Arnold, D.B., Sleep, M.R.: Uniform Random Generation of Balanced Parenthesis Strings. ACM Transaction Programming Languages and Systems\u00a02(1), 122\u2013128 (1980)","journal-title":"ACM Transaction Programming Languages and Systems"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse Search for Enumeration. Discrete Applied Mathematics\u00a065, 21\u201346 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0020-0190(83)90078-9","volume":"17","author":"A.A. Bertossi","year":"1983","unstructured":"Bertossi, A.A.: Finding Hamiltonian Circuits in Proper Interval Graphs. Information Processing Letters\u00a017(2), 97\u2013101 (1983)","journal-title":"Information Processing Letters"},{"key":"16_CR4","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. Discrete Mathematics\u00a0201, 21\u201323 (1999)","journal-title":"Discrete Mathematics"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.disc.2004.01.021","volume":"298","author":"N. Bonichon","year":"2005","unstructured":"Bonichon, N.: A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. Discrete Mathematics\u00a0298, 104\u2013114 (2005)","journal-title":"Discrete Mathematics"},{"key":"16_CR6","doi-asserted-by":"publisher","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":"16_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P.Z. Chinn","year":"1982","unstructured":"Chinn, P.Z., Chv\u00e1talov\u00e1, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices \u2014 A survey. Journal of Graph Theory\u00a06, 223\u2013254 (1982)","journal-title":"Journal of Graph Theory"},{"key":"16_CR8","unstructured":"de Figueiredo, C.M.H., Meidanis, J., de Mello, C.P.: A lexBFS Algorithm for Proper Interval Graph Recognition. IC DCC-04\/93, Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas (1993)"},{"issue":"2","key":"16_CR9","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 Journal on Computing\u00a025(2), 390\u2013403 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. LNCS, vol.\u00a03109, pp. 159\u2013172. Springer, Heidelberg (2004)"},{"key":"16_CR11","volume-title":"Annals of Discrete Mathematics","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. In: Annals of Discrete Mathematics, 2nd edn., vol.\u00a057. Elsevier, Amsterdam (2004)","edition":"2"},{"key":"16_CR12","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)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/S0895480103430259","volume":"18","author":"P. Hell","year":"2005","unstructured":"Hell, P., Huang, J.: Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs. SIAM J. Discrete Math.\u00a018, 554\u2013570 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0097539700372216","volume":"31","author":"P. Hell","year":"2001","unstructured":"Hell, P., Shamir, R., Sharan, R.: A fully dynamic algorithm for recognizing and representing proper interval graphs. SIAM Journal on Computing\u00a031, 289\u2013305 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR15","unstructured":"Nakano, S.-i.: Enumerating Floorplans with n Rooms. IEICE Transactions on Fundamentals E85-A(7), 1746\u20131750 (2002)"},{"key":"16_CR16","unstructured":"Nakano, S.-i.: Personal communication (2008)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-72504-6_10","volume-title":"Theory and Applications of Models of Computation","author":"S.-i. Nakano","year":"2007","unstructured":"Nakano, S.-i., Uehara, R., Uno, T.: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 115\u2013127. Springer, Heidelberg (2007)"},{"key":"16_CR18","unstructured":"Kaneko, Y., Nakano, S.-i.: Random Generation of Plane Graphs and Its Application. IEICE Transactions on Fundamentals J85-A(9), 976\u2013983 (2002)"},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/S0097539793258143","volume":"25","author":"H. Kaplan","year":"1996","unstructured":"Kaplan, H., Shamir, R.: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques. SIAM Journal on Computing\u00a025(3), 540\u2013561 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"16_CR20","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H. Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs. SIAM Journal on Computing\u00a028(5), 1906\u20131922 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR21","unstructured":"Karttunen, A.: Personal communication (2008)"},{"key":"16_CR22","series-title":"The Art of Computer Programming","volume-title":"Generating All Trees","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: Generating All Trees, 4th edn. The Art of Computer Programming, vol.\u00a04. Addison-Wesley, Reading (2005)","edition":"4"},{"issue":"2","key":"16_CR23","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<75::AID-JGT1>3.0.CO;2-S","volume":"31","author":"Y.L. Lai","year":"1999","unstructured":"Lai, Y.L., Williams, K.: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. Journal of Graph Theory\u00a031(2), 75\u201394 (1999)","journal-title":"Journal of Graph Theory"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-48224-5_36","volume-title":"Automata, Languages and Programming","author":"Z. Li","year":"2001","unstructured":"Li, Z., Nakano, S.-i.: Efficient generation of plane triangulations without repetitions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 433\u2013443. Springer, Heidelberg (2001)"},{"issue":"2","key":"16_CR25","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. Journal of the ACM\u00a026(2), 183\u2013195 (1979)","journal-title":"Journal of the ACM"},{"issue":"4","key":"16_CR26","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0607057","volume":"7","author":"B. Monien","year":"1986","unstructured":"Monien, B.: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete. SIAM J. Alg. Disc. Meth.\u00a07(4), 505\u2013512 (1986)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"16_CR27","first-page":"118","volume-title":"Proc. 38th ACM Symp. on the Theory of Computing","author":"J.I. Munro","year":"1997","unstructured":"Munro, J.I., Raman, V.: Succinct Representation of Balanced Parentheses, Static Trees and Planar graphs. In: Proc. 38th ACM Symp. on the Theory of Computing, pp. 118\u2013126. ACM Press, New York (1997)"},{"key":"16_CR28","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 Journal on Computing\u00a031, 762\u2013776 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-30559-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S.-i. Nakano","year":"2004","unstructured":"Nakano, S.-i., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 33\u201345. Springer, Heidelberg (2004)"},{"issue":"3","key":"16_CR30","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. Information Processing Letters\u00a084(3), 167\u2013172 (2002)","journal-title":"Information Processing Letters"},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0020-0190(03)00298-9","volume":"87","author":"B.S. Panda","year":"2003","unstructured":"Panda, B.S., Das, S.K.: A Linear Time Recognition Algorithm for Proper Interval Graphs. Information Processing Letters\u00a087, 153\u2013161 (2003)","journal-title":"Information Processing Letters"},{"key":"16_CR32","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C.H. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing\u00a016, 263\u2013270 (1976)","journal-title":"Computing"},{"key":"16_CR33","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":"16_CR34","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol.\u00a02. Cambridge (1997)","DOI":"10.1017\/CBO9780511805967"},{"issue":"3","key":"16_CR35","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. Discrete Applied Mathematics\u00a0145(3), 479\u2013482 (2004)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T23:07:33Z","timestamp":1558134453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}