{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:59:52Z","timestamp":1743069592702,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617912"},{"type":"electronic","value":"9783030617929"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61792-9_37","type":"book-chapter","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:15:48Z","timestamp":1606943748000},"page":"464-475","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Hardness of Sampling Connected Subgraphs"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Read-McFarland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,3]]},"reference":[{"key":"37_CR1","unstructured":"Aldous, D., Fill, J.A.: Reversible Markov chains and random walks on graphs (2002). https:\/\/www.stat.berkeley.edu\/users\/aldous\/RWG\/book.pdf. Unfinished monograph, recompiled 2014"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Baskerville, K., Grassberger, P., Paczuski, M.: Graph animals, subgraph sampling, and motif search in large networks. Phys. Rev. E 76(3), 036107, 13 (2007)","DOI":"10.1103\/PhysRevE.76.036107"},{"key":"37_CR3","unstructured":"Frieze, A.: Notes on Counting and rapidly mixing Markov chains. http:\/\/www.math.cmu.edu\/~af1p\/Mixing.html"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-71681-5_7","volume-title":"Research in Computational Molecular Biology","author":"JA Grochow","year":"2007","unstructured":"Grochow, J.A., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS, vol. 4453, pp. 92\u2013106. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71681-5_7"},{"key":"37_CR5","unstructured":"Guo, H., Jerrum, M.: A polynomial-time approximation algorithm for all-terminal network reliability. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, 9\u201313 July 2018, pp. 68:1\u201368:12 (2018)"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02980577","volume":"31","author":"E Ising","year":"1925","unstructured":"Ising, E.: Contribution to the theory of ferromagnetism. Z. Phys. 31, 253\u2013258 (1925)","journal-title":"Z. Phys."},{"issue":"4","key":"37_CR7","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.jcss.2014.11.015","volume":"81","author":"M Jerrum","year":"2015","unstructured":"Jerrum, M., Meeks, K.: The parameterised complexity of counting connected subgraphs and graph motifs. J. Comput. Syst. Sci. 81(4), 702\u2013716 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"37_CR8","unstructured":"Jung, K., Shah, D.: Inference in binary pair-wise Markov random fields through self-avoiding walks. arXiv e-prints p. cs\/0610111 (2006)"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-319-12340-0_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"K Kangas","year":"2014","unstructured":"Kangas, K., Kaski, P., Koivisto, M., Korhonen, J.H.: On the number of connected sets in bounded degree graphs. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 336\u2013347. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12340-0_28"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, Boston (1972)"},{"issue":"11","key":"37_CR11","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan, N., Milo, R., Itzkovitz, S., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11), 1746\u20131758 (2004)","journal-title":"Bioinformatics"},{"key":"37_CR12","first-page":"613","volume":"21","author":"W Lenz","year":"1920","unstructured":"Lenz, W.: Beitrag zum Verst\u00e4ndnis der magnetischen Erscheinungen in festen K\u00f6rpern. Z. Phys. 21, 613\u2013615 (1920)","journal-title":"Z. Phys."},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-31235-9_13","volume-title":"Scientific and Statistical Database Management","author":"X Lu","year":"2012","unstructured":"Lu, X., Bressan, S.: Sampling connected induced subgraphs uniformly at random. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 195\u2013212. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31235-9_13"},{"issue":"1","key":"37_CR14","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.jda.2004.05.002","volume":"3","author":"T \u0141uczak","year":"2005","unstructured":"\u0141uczak, T., Vigoda, E.: Torpid mixing of the Wang-Swendsen-Koteck\u00fd algorithm for sampling colorings. J. Discret. Algorithms 3(1), 92\u2013100 (2005)","journal-title":"J. Discret. Algorithms"},{"issue":"3","key":"37_CR15","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00440-007-0131-9","volume":"143","author":"E Mossel","year":"2009","unstructured":"Mossel, E., Weitz, D., Wormald, N.: On the hardness of sampling independent sets beyond the tree threshold. Probab. Theory Relat. Fields 143(3), 401\u2013439 (2009)","journal-title":"Probab. Theory Relat. Fields"},{"issue":"6","key":"37_CR16","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1137\/16M1101003","volume":"46","author":"V Patel","year":"2017","unstructured":"Patel, V., Regts, G.: Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. SIAM J. Comput. 46(6), 1893\u20131919 (2017)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"37_CR17","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1007\/s00453-018-0511-9","volume":"81","author":"V Patel","year":"2018","unstructured":"Patel, V., Regts, G.: Computing the number of induced copies of a fixed graph in a bounded degree graph. Algorithmica 81(5), 1844\u20131858 (2018)","journal-title":"Algorithmica"},{"key":"37_CR18","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.: The rectilinear steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"37_CR19","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10015-018-0473-7","volume":"23","author":"W Savoie","year":"2018","unstructured":"Savoie, W., et al.: Phototactic supersmarticles. Artif. Life Robot. 23(4), 459\u2013468 (2018). https:\/\/doi.org\/10.1007\/s10015-018-0473-7","journal-title":"Artif. Life Robot."},{"key":"37_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0323-0","volume-title":"Algorithms for Random Generation and Counting: A Markov Chain Approach","author":"A Sinclair","year":"1993","unstructured":"Sinclair, A.: Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhauser Verlag, Basel (1993)"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Sly, A.: Computational transition at the uniqueness threshold. In: Proceedings of the 51st IEEE Annual Symposium on Foundations of Computer Science, FOCS, pp. 287\u2013296 (2010)","DOI":"10.1109\/FOCS.2010.34"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative Combinatorics: vol. 2, 1st edn. Cambridge University Press, New York (1999)","DOI":"10.1017\/CBO9780511609589"},{"issue":"2","key":"37_CR23","first-page":"281","volume":"67","author":"A Vince","year":"2017","unstructured":"Vince, A.: Counting connected sets and connected partitions of a graph. Australas. J. Comb. 67(2), 281\u2013293 (2017)","journal-title":"Australas. J. Comb."},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"Weitz, D.: Counting independent sets up to the tree threshold. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC, pp. 140\u2013149. ACM, New York (2006)","DOI":"10.1145\/1132516.1132538"},{"issue":"1","key":"37_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230150109","volume":"15","author":"K White","year":"1985","unstructured":"White, K., Farber, M., Pulleyblank, W.: Steiner trees, connected domination and strongly chordal graphs. Networks 15(1), 109\u2013124 (1985)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","LATIN 2020: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61792-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T21:45:51Z","timestamp":1606945551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61792-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617912","9783030617929"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61792-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sao Paulo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2020.ime.usp.br\/","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":"136","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":"50","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":"37% - 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,16","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the symposium was moved from May 2020 to January 2021.","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)"}}]}}