{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:15:23Z","timestamp":1743128123296,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_29","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"352-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counting and\u00a0Sampling Orientations on\u00a0Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Ivona","family":"Bez\u00e1kov\u00e1","sequence":"first","affiliation":[]},{"given":"Wenbo","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Agnarsson, G.: On chordal graphs and their chromatic polynomials. Math. Scand. 93, 240\u2013246 (2003)","DOI":"10.7146\/math.scand.a-14421"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4613-8369-7_1","volume-title":"Graph Theory and Sparse Matrix Computation","author":"JR Blair","year":"1993","unstructured":"Blair, J.R., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1\u201329. Springer, New York (1993). https:\/\/doi.org\/10.1007\/978-1-4613-8369-7_1"},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0196-6774(85)90006-9","volume":"6","author":"PB Borwein","year":"1985","unstructured":"Borwein, P.B.: On the complexity of calculating factorials. J. Algorithms 6(3), 376\u2013380 (1985)","journal-title":"J. Algorithms"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1017\/CBO9780511662041.007","volume":"40","author":"T Brylawski","year":"1992","unstructured":"Brylawski, T., Oxley, J.: The tutte polynomial and its applications. Matroid Appl. 40, 123\u2013225 (1992)","journal-title":"Matroid Appl."},{"key":"29_CR5","unstructured":"Bubley, R., Dyer, M.: Graph orientations with no sink and an approximation for a hard case of #SAT. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 248\u2013257 (1997)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Cohn, H., Pemantle, R., Propp, J.: Generating a random sink-free orientation in quadratic time. arXiv preprint math\/0103189 (2001)","DOI":"10.37236\/1627"},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3310131","volume":"66","author":"H Guo","year":"2019","unstructured":"Guo, H., Jerrum, M., Liu, J.: Uniform sampling through the Lov\u00e1sz local lemma. J. ACM (JACM) 66(3), 1\u201331 (2019)","journal-title":"J. ACM (JACM)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Huber, M.: Exact sampling and approximate counting techniques. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 31\u201340 (1998)","DOI":"10.1145\/276698.276709"},{"key":"29_CR9","volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. MIT Press, Cambridge (2009)"},{"issue":"2","key":"29_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/0607036","volume":"7","author":"N Linial","year":"1986","unstructured":"Linial, N.: Hard enumeration problems in geometry and combinatorics. SIAM J. Algebraic Discrete Methods 7(2), 331\u2013335 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jda.2006.07.006","volume":"6","author":"Y Okamoto","year":"2008","unstructured":"Okamoto, Y., Uno, T., Uehara, R.: Counting the number of independent sets in chordal graphs. J. Discrete Algorithms 6(2), 229\u2013242 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"29_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1561\/2400000006","volume":"1","author":"L Vandenberghe","year":"2015","unstructured":"Vandenberghe, L., Andersen, M.S.: Chordal graphs and semidefinite optimization. Found. Trends Optim. 1(4), 241\u2013433 (2015)","journal-title":"Found. Trends Optim."},{"issue":"2","key":"29_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1017\/S0963548300000195","volume":"1","author":"DL Vertigan","year":"1992","unstructured":"Vertigan, D.L., Welsh, D.J.: The computational complexity of the tutte plane: the bipartite case. Comb. Probab. Comput. 1(2), 181\u2013187 (1992)","journal-title":"Comb. Probab. Comput."},{"issue":"3\u20134","key":"29_CR14","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<210::AID-RSA2>3.0.CO;2-R","volume":"15","author":"D Welsh","year":"1999","unstructured":"Welsh, D.: The tutte polynomial. Random Struct. Algorithms 15(3\u20134), 210\u2013228 (1999)","journal-title":"Random Struct. Algorithms"},{"key":"29_CR15","first-page":"287","volume":"241","author":"DJ Welsh","year":"1997","unstructured":"Welsh, D.J.: Approximate counting. Surv. Comb. 241, 287\u2013324 (1997)","journal-title":"Surv. Comb."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Wien\u00f6bst, M., Bannach, M., Li\u015bkiewicz, M.: Polynomial-time algorithms for counting and sampling Markov equivalent dags. In: Proccedings of the 35th Conference on Artificial Intelligence, AAAI (2021)","DOI":"10.1007\/978-3-030-87626-5_20"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:07:39Z","timestamp":1647389259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The proceedings also include 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}