{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:13:25Z","timestamp":1760170405791},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T00:00:00Z","timestamp":1183680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,10,12]]},"DOI":"10.1007\/s10479-007-0190-4","type":"journal-article","created":{"date-parts":[[2007,7,5]],"date-time":"2007-07-05T16:02:34Z","timestamp":1183651354000},"page":"47-60","source":"Crossref","is-referenced-by-count":14,"title":["Two methods for the generation of chordal graphs"],"prefix":"10.1007","volume":"157","author":[{"given":"Lilian","family":"Markenzon","sequence":"first","affiliation":[]},{"given":"Oswaldo","family":"Vernet","sequence":"additional","affiliation":[]},{"given":"Luiz Henrique","family":"Araujo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,7,6]]},"reference":[{"key":"190_CR1","first-page":"1","volume":"6","author":"D. Alberts","year":"1997","unstructured":"Alberts, D., Cattaneo, G., & Italiano, G. F. (1997). An empirical study of dynamic graph algorithms. ACM Journal of Experimental Algorithms, 6, 1\u201339.","journal-title":"ACM Journal of Experimental Algorithms"},{"key":"190_CR2","unstructured":"Araujo, L. H. (2004). Algoritmos din\u00e2micos para manuten\u00e7\u00e3o de grafos cordais e periplanares. Ph.D. Thesis, Coppe-Produ\u00e7\u00e3o, Universidade Federal do Rio de Janeiro, RJ, Brasil."},{"key":"190_CR3","series-title":"Graph theory and sparse matrix computation","first-page":"1","volume-title":"IMA volumes in mathematics and its applications","author":"J. R. S. Blair","year":"1993","unstructured":"Blair, J. R. S., & Peyton, B. (1993). An introduction to chordal graphs and clique trees. In J. A. George, J. R. Gilbert & J. W. Liu (Eds.), IMA volumes in mathematics and its applications : Vol. 56. Graph theory and sparse matrix computation (pp. 1\u201329). Berlin: Springer."},{"key":"190_CR4","doi-asserted-by":"crossref","unstructured":"Berry, A., Heggernes, P., & Villanger, Y. (2003). A vertex incremental approach for dynamically maintaining chordal graphs. In Proceedings of the 14th international symposium on algorithms and computation (ISAAC 2003), Springer LNCS 2906, pp. 47\u201357.","DOI":"10.1007\/978-3-540-24587-2_7"},{"key":"190_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0304-3975(03)00221-4","volume":"307","author":"L. S. Chandran","year":"2003","unstructured":"Chandran, L. S., Ibarra, L., Ruskey, F., & Sawada, J. (2003). Generating and characterizing the perfect elimination orderings of a chordal graph. Theoretical Computer Science, 307, 303\u2013317.","journal-title":"Theoretical Computer Science"},{"key":"190_CR6","first-page":"77","volume":"34","author":"N. Deo","year":"2002","unstructured":"Deo, N., & Micikevicius, P. (2002). A new encoding for labeled trees employing a stack and a queue. Bulletin of the Institute of Combinatorics and Its Applications, 34, 77\u201385.","journal-title":"Bulletin of the Institute of Combinatorics and Its Applications"},{"key":"190_CR7","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/265910.265914","volume":"44","author":"D. Eppstein","year":"1997","unstructured":"Eppstein, D., Galil, Z., & Italiano, G. F. (1997). Sparsification\u2014a technique for speeding up dynamic graph algorithms. Journal of the ACM, 44, 669\u2013696.","journal-title":"Journal of the ACM"},{"key":"190_CR8","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F. (1972). Algorithms for minimum coloring, minimum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing, 1, 180\u2013187.","journal-title":"SIAM Journal on Computing"},{"key":"190_CR9","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C. Golumbic","year":"1980","unstructured":"Golumbic, M. C. (1980). Algorithmic graph theory and perfect graphs. New York: Academic."},{"key":"190_CR10","unstructured":"Ibarra, L. (2000). Fully dynamic algorithms for chordal graphs and split graphs. Technical Report DCS-262-IR, University of Victoria, http:\/\/facweb.cs.depaul.edu\/ibarra\/research.htm ."},{"key":"190_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0166-218X(00)00336-X","volume":"117","author":"P. S. Kumar","year":"2002","unstructured":"Kumar, P. S., & Madhavan, C. E. V. (2002). Clique tree generalization and new subclasses of chordal graphs. Discrete Applied Mathematics, 117, 109\u2013131.","journal-title":"Discrete Applied Mathematics"},{"key":"190_CR12","unstructured":"Markenzon, L., Vernet, O., & Araujo, L. H. (2004). Two methods for the generation of chordal graphs. Technical Report NCE-13\/04, Universidade Federal do Rio de Janeiro."},{"key":"190_CR13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. J. Rose","year":"1976","unstructured":"Rose, D. J., Tarjan, R. E., & Lueker, G. (1976). Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5, 266\u2013283.","journal-title":"SIAM Journal on Computing"},{"key":"190_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data structures and network algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"Tarjan, R. E. (1983). Data structures and network algorithms. Philadelphia: SIAM."},{"key":"190_CR15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-7091-9076-0_12","volume":"7","author":"G. Tinhofer","year":"1990","unstructured":"Tinhofer, G. (1990). Generating graphs uniformly at random. Computing Supplement, 7, 235\u2013255.","journal-title":"Computing Supplement"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0190-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-007-0190-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0190-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:41Z","timestamp":1559138861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-007-0190-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,6]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,10,12]]}},"alternative-id":["190"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0190-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,6]]}}}