The challenges of unbounded treewidth in parameterised subgraph counting problems
Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent progress in this area. Many of the existing tractability results for parameterised problems which involve finding or counting subgraphs with p...
Uloženo v:
| Vydáno v: | Discrete Applied Mathematics Ročník 198; s. 170 - 194 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
10.01.2016
|
| Témata: | |
| ISSN: | 0166-218X, 1872-6771 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent progress in this area. Many of the existing tractability results for parameterised problems which involve finding or counting subgraphs with particular properties rely on bounding the treewidth of these subgraphs in some sense; here, we prove a number of hardness results for the situation in which this bounded treewidth condition does not hold, resulting in dichotomies for some special cases of the general subgraph counting problem. The paper also gives a thorough survey of known results on this subject and the methods used, as well as discussing the relationships both between multicolour and uncoloured versions of subgraph counting problems, and between exact counting, approximate counting and the corresponding decision problems. |
|---|---|
| AbstractList | Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent progress in this area. Many of the existing tractability results for parameterised problems which involve finding or counting subgraphs with particular properties rely on bounding the treewidth of these subgraphs in some sense; here, we prove a number of hardness results for the situation in which this bounded treewidth condition does not hold, resulting in dichotomies for some special cases of the general subgraph counting problem. The paper also gives a thorough survey of known results on this subject and the methods used, as well as discussing the relationships both between multicolour and uncoloured versions of subgraph counting problems, and between exact counting, approximate counting and the corresponding decision problems. |
| Author | Meeks, Kitty |
| Author_xml | – sequence: 1 givenname: Kitty surname: Meeks fullname: Meeks, Kitty email: kitty.meeks@glasgow.ac.uk organization: School of Mathematical Sciences, Queen Mary University of London, London E1 4NS, UK |
| BookMark | eNp9kEtLAzEQgINUsK3-AG_5A7tO9pVdPEnxBQURKngL2WS2m7KbLUmq-O9NqScPvcyDmW9gvgWZ2ckiIbcMUgasutulWo5pBqxMoUqBNRdkzmqeJRXnbEbmcadKMlZ_XpGF9zsAYLGbk_dNj1T1chjQbtHTqaMH204Hq1HT4BC_jQ49NZbupZMjBnTGx5E_tFsn9z1VcTcYu6V7N7UDjv6aXHZy8Hjzl5fk4-lxs3pJ1m_Pr6uHdaLyAkLCO44qa2Qp81zFuq7zplSlAtl2DStiaHUBSiHUGdN5qRvWtrosOg4lR63zJeGnu8pN3jvshDJBBjPZ4KQZBANxNCN2IpoRRzMCKhHNRJL9I_fOjNL9nGXuTwzGl74MOuGVQatQG4cqCD2ZM_QvNqWAfA |
| CitedBy_id | crossref_primary_10_1145_3689634 crossref_primary_10_1145_3520240 crossref_primary_10_1016_j_tcs_2017_09_022 crossref_primary_10_1145_3560820 crossref_primary_10_1007_s00224_018_9893_y crossref_primary_10_1007_s00453_021_00894_9 crossref_primary_10_1137_19M130604X crossref_primary_10_1137_22M1535668 crossref_primary_10_1137_22M1479804 crossref_primary_10_1145_3389390 crossref_primary_10_1007_s00453_020_00676_9 crossref_primary_10_1007_s00493_016_3338_5 crossref_primary_10_1007_s00453_023_01114_2 crossref_primary_10_1137_22M1512211 crossref_primary_10_1016_j_jcss_2017_03_005 crossref_primary_10_1137_20M1365624 crossref_primary_10_1007_s00453_018_0404_y |
| Cites_doi | 10.1016/j.tcs.2004.08.008 10.1080/15427951.2012.625260 10.1016/0095-8956(86)90030-4 10.1109/ICDM.2008.72 10.1137/0219054 10.1007/s00224-011-9381-0 10.1145/210332.210337 10.1016/S0304-3975(01)00414-5 10.1137/09076619X 10.1109/SFCS.1983.35 10.1145/1206035.1206036 10.1016/j.tcs.2008.09.065 10.1137/S0097539703427203 10.1137/100789403 10.1109/TCBB.2011.19 10.1137/0208032 10.1002/1098-2418(200010/12)17:3/4<260::AID-RSA5>3.0.CO;2-W 10.1016/j.tcs.2007.05.023 10.1007/BF02523189 10.1126/science.298.5594.824 10.1137/0214017 10.1007/s00453-011-9600-8 10.1145/828.1884 10.1016/j.jcss.2014.11.015 10.1109/FOCS.2014.22 10.1016/S0304-3975(96)00317-9 10.1109/ICOIN.2001.905436 10.1145/380752.380867 10.1016/0304-3975(94)00097-3 10.1002/net.3230250404 10.1145/2786017 10.1137/S0097539797321602 10.1137/1.9781611973730.41 10.1145/1798596.1798607 |
| ContentType | Journal Article |
| Copyright | 2015 The Author |
| Copyright_xml | – notice: 2015 The Author |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.dam.2015.06.019 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1872-6771 |
| EndPage | 194 |
| ExternalDocumentID | 10_1016_j_dam_2015_06_019 S0166218X15003054 |
| GrantInformation_xml | – fundername: EPSRC grantid: EP/I011935/1 funderid: http://dx.doi.org/10.13039/501100000266 |
| GroupedDBID | -~X 6I. AAFTH ADEZE AFTJW ALMA_UNASSIGNED_HOLDINGS FDB OAUVE AAYXX AI. CITATION FA8 VH1 WUQ |
| ID | FETCH-LOGICAL-c340t-7f7ec29a5a33cf7e88395c5c0abf914bf9bd40cce0821d35d91bbd54f7057edd3 |
| ISICitedReferencesCount | 35 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000366786000015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0166-218X |
| IngestDate | Sat Nov 29 07:46:34 EST 2025 Tue Nov 18 22:18:52 EST 2025 Sat Apr 29 22:45:09 EDT 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Counting complexity Subgraph counting FPTRAS Parameterised complexity |
| Language | English |
| License | http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c340t-7f7ec29a5a33cf7e88395c5c0abf914bf9bd40cce0821d35d91bbd54f7057edd3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.dam.2015.06.019 |
| PageCount | 25 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_dam_2015_06_019 crossref_primary_10_1016_j_dam_2015_06_019 elsevier_sciencedirect_doi_10_1016_j_dam_2015_06_019 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-01-10 |
| PublicationDateYYYYMMDD | 2016-01-10 |
| PublicationDate_xml | – month: 01 year: 2016 text: 2016-01-10 day: 10 |
| PublicationDecade | 2010 |
| PublicationTitle | Discrete Applied Mathematics |
| PublicationYear | 2016 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Flum, Grohe (br000125) 2006 Sundaram, Skiena (br000235) 1995; 25 Montoya, Müller (br000195) 2013; 52 Becchetti, Boldi, Castillo, Gionis (br000035) 2008 Erdős, Szekeres (br000105) 1935; 2 [math.CO]. Radu Curticapean, Dániel Marx, Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts, in: 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014, 2014. C.E. Tsourakakis, Fast counting of triangles in large real networks without counting: Algorithms and laws, Data Mining, 2008. ICDM’08, in: Eighth IEEE International Conference on, Dec 2008, pp. 608–617. Downey, Fellows (br000090) 1995; 141 Dyer, Greenhill (br000100) 2000; 17 Schank, Wagner (br000215) 2005; vol. 3503 Dalmau, Jonsson (br000085) 2004; 329 Plehn, Voigt (br000200) 1990; vol. 484 Mark Jerrum, Kitty Meeks, The parameterised complexity of counting even and odd induced subgraphs, 2014. Downey, Fellows, Regan (br000095) 1998; 191 Jerrum, Meeks (br000155) 2015; 81 Bläser, Curticapean (br000050) 2012; vol. 7535 Schmidt, Siegel (br000220) 1990; 19 Grohe (br000140) 2007; 54 [cs.CC]. Biclique, in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015, pp. 605–615. Chen, Müller (br000060) 2013 Flum, Grohe (br000120) 2004; 33 Jerrum, Meeks (br000160) 2015; 7 Slot, van Emde~Boas (br000210) 1984 Xia, Zhang, Zhao (br000260) 2007; 384 V. Sekar, Y. Xie, D.A. Maltz, M.K. Reiter, H. Zhang, Toward a Framework for Internet Forensic Analysis, in: Third Workshop on Hot Topics in Networking (HotNets-III), 2004. Alon, Yuster, Zwick (br000015) 1995; 42 Arvind, Raman (br000030) 2002; vol. 2518 Kolountzakis, Miller, Peng, Tsourakakis (br000180) 2012; 8 Vadhan (br000245) 2001; 31 Färnqvist, Jonsson (br000110) 2007; vol. 4835 B. Gelbord, Graphical techniques in intrusion detection systems, Information Networking, 2001, in: Proceedings. 15th International Conference on, 2001, pp. 253–258. Guillemot, Sikora (br000150) 2013; 65 Martin Grohe, Thomas Schwentick, Luc Segoufin, When is the evaluation of conjunctive queries tractable?, in: Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001, pp. 657–666. Bingkai Lin, The parameterized complexity of Alon, Gutner (br000005) 2009; vol. 5917 Chen, Thurley, Weyer (br000065) 2008; vol. 5125 R.M. Karp, M. Luby, Monte-carlo algorithms for enumeration and reliability problems, in: Proeedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, 1983, pp. 56–64. Ankit Chauhan, B.V. Raghavendra Rao, Parameterized analogues of probabilistic computation, 2014. Björklund, Husfeldt, Kaski, Koivisto (br000045) 2009; vol. 5757 Betzler, van Bevern, Fellows, Komusiewicz, Niedermeier (br000040) 2011; 8 Amini, Fomin, Saurabh (br000025) 2012; 26 Khot, Raman (br000175) 2002; 289 Curticapean (br000075) 2013; vol. 7965 Alon, Gutner (br000010) 2010; 6 Williams, Williams (br000255) 2013; 42 Chiba, Nishizeki (br000070) 1985; 14 Fellows, Hermelin, Rosamond, Vialette (br000115) 2009; 410 Milo, Shen-Orr, Itzkovitz, Kashtan, Chklovskii, Alon (br000190) 2002; 298 S. Staniford-chen, S. Cheung, R. Crawford, M. Dilger, J. Frank, J. Hoagl, K. Levitt, C. Wee, R. Yip, D. Zerkle, GrIDS–a graph based intrusion detection system for large networks, in: Proceedings of the 19th National Information Systems Security Conference, 1996, pp. 361–370. Valiant (br000250) 1979; 8 Fredman, Komlós, Szemerédi (br000130) 1984; 31 Alon, Yuster, Zwick (br000020) 1997; 17 Robertson, Seymour (br000205) 1986; 41 Dalmau (10.1016/j.dam.2015.06.019_br000085) 2004; 329 10.1016/j.dam.2015.06.019_br000080 Alon (10.1016/j.dam.2015.06.019_br000010) 2010; 6 Flum (10.1016/j.dam.2015.06.019_br000120) 2004; 33 Khot (10.1016/j.dam.2015.06.019_br000175) 2002; 289 Schank (10.1016/j.dam.2015.06.019_br000215) 2005; vol. 3503 Betzler (10.1016/j.dam.2015.06.019_br000040) 2011; 8 10.1016/j.dam.2015.06.019_br000240 Arvind (10.1016/j.dam.2015.06.019_br000030) 2002; vol. 2518 Guillemot (10.1016/j.dam.2015.06.019_br000150) 2013; 65 Slot (10.1016/j.dam.2015.06.019_br000210) 1984 Vadhan (10.1016/j.dam.2015.06.019_br000245) 2001; 31 Fredman (10.1016/j.dam.2015.06.019_br000130) 1984; 31 Becchetti (10.1016/j.dam.2015.06.019_br000035) 2008 Kolountzakis (10.1016/j.dam.2015.06.019_br000180) 2012; 8 Jerrum (10.1016/j.dam.2015.06.019_br000160) 2015; 7 Chiba (10.1016/j.dam.2015.06.019_br000070) 1985; 14 10.1016/j.dam.2015.06.019_br000165 Färnqvist (10.1016/j.dam.2015.06.019_br000110) 2007; vol. 4835 Jerrum (10.1016/j.dam.2015.06.019_br000155) 2015; 81 Downey (10.1016/j.dam.2015.06.019_br000090) 1995; 141 Dyer (10.1016/j.dam.2015.06.019_br000100) 2000; 17 Björklund (10.1016/j.dam.2015.06.019_br000045) 2009; vol. 5757 Valiant (10.1016/j.dam.2015.06.019_br000250) 1979; 8 Williams (10.1016/j.dam.2015.06.019_br000255) 2013; 42 10.1016/j.dam.2015.06.019_br000230 Sundaram (10.1016/j.dam.2015.06.019_br000235) 1995; 25 Alon (10.1016/j.dam.2015.06.019_br000020) 1997; 17 Plehn (10.1016/j.dam.2015.06.019_br000200) 1990; vol. 484 Chen (10.1016/j.dam.2015.06.019_br000060) 2013 Erdős (10.1016/j.dam.2015.06.019_br000105) 1935; 2 10.1016/j.dam.2015.06.019_br000185 Grohe (10.1016/j.dam.2015.06.019_br000140) 2007; 54 Amini (10.1016/j.dam.2015.06.019_br000025) 2012; 26 Alon (10.1016/j.dam.2015.06.019_br000005) 2009; vol. 5917 Xia (10.1016/j.dam.2015.06.019_br000260) 2007; 384 Montoya (10.1016/j.dam.2015.06.019_br000195) 2013; 52 Alon (10.1016/j.dam.2015.06.019_br000015) 1995; 42 Schmidt (10.1016/j.dam.2015.06.019_br000220) 1990; 19 10.1016/j.dam.2015.06.019_br000145 10.1016/j.dam.2015.06.019_br000225 Flum (10.1016/j.dam.2015.06.019_br000125) 2006 Bläser (10.1016/j.dam.2015.06.019_br000050) 2012; vol. 7535 10.1016/j.dam.2015.06.019_br000170 Chen (10.1016/j.dam.2015.06.019_br000065) 2008; vol. 5125 Robertson (10.1016/j.dam.2015.06.019_br000205) 1986; 41 Downey (10.1016/j.dam.2015.06.019_br000095) 1998; 191 Milo (10.1016/j.dam.2015.06.019_br000190) 2002; 298 Curticapean (10.1016/j.dam.2015.06.019_br000075) 2013; vol. 7965 10.1016/j.dam.2015.06.019_br000055 10.1016/j.dam.2015.06.019_br000135 Fellows (10.1016/j.dam.2015.06.019_br000115) 2009; 410 |
| References_xml | – volume: 17 start-page: 209 year: 1997 end-page: 223 ident: br000020 article-title: Finding and counting given length cycles publication-title: Algorithmica – reference: [cs.CC]. – start-page: 309 year: 2013 end-page: 320 ident: br000060 article-title: The fine classification of conjunctive queries and parameterized logarithmic space complexity publication-title: Proceedings of the 32Nd Symposium on Principles of Database Systems (New York, NY, USA) – reference: V. Sekar, Y. Xie, D.A. Maltz, M.K. Reiter, H. Zhang, Toward a Framework for Internet Forensic Analysis, in: Third Workshop on Hot Topics in Networking (HotNets-III), 2004. – volume: 25 start-page: 183 year: 1995 end-page: 191 ident: br000235 article-title: Recognizing small subgraphs publication-title: Networks – volume: 298 start-page: 824 year: 2002 end-page: 827 ident: br000190 article-title: Network motifs: Simple building blocks of complex networks publication-title: Science – volume: vol. 5757 start-page: 578 year: 2009 end-page: 586 ident: br000045 article-title: Counting paths and packings in halves publication-title: Algorithms - ESA 2009 – volume: 14 start-page: 210 year: 1985 end-page: 223 ident: br000070 article-title: Arboricity and subgraph listing algorithms publication-title: SIAM J. Comput. – reference: S. Staniford-chen, S. Cheung, R. Crawford, M. Dilger, J. Frank, J. Hoagl, K. Levitt, C. Wee, R. Yip, D. Zerkle, GrIDS–a graph based intrusion detection system for large networks, in: Proceedings of the 19th National Information Systems Security Conference, 1996, pp. 361–370. – volume: vol. 7965 start-page: 352 year: 2013 end-page: 363 ident: br000075 article-title: Counting matchings of size k is #W[1]-hard publication-title: Automata, Languages, and Programming – volume: vol. 7535 start-page: 171 year: 2012 end-page: 181 ident: br000050 article-title: Weighted counting of publication-title: Parameterized and Exact Computation – reference: B. Gelbord, Graphical techniques in intrusion detection systems, Information Networking, 2001, in: Proceedings. 15th International Conference on, 2001, pp. 253–258. – volume: vol. 2518 start-page: 453 year: 2002 end-page: 464 ident: br000030 article-title: Approximation algorithms for some parameterized counting problems publication-title: ISAAC 2002 – volume: 6 start-page: 54:1 year: 2010 end-page: 54:12 ident: br000010 article-title: Balanced families of perfect hash functions and their applications publication-title: ACM Trans. Algorithms – volume: 7 year: 2015 ident: br000160 article-title: Some hard families of parameterised counting problems publication-title: ACM Trans. Comput. Theory – volume: 26 start-page: 695 year: 2012 end-page: 717 ident: br000025 article-title: Counting subgraphs via homomorphisms publication-title: SIAM J. Discrete Math. – volume: vol. 5125 start-page: 587 year: 2008 end-page: 596 ident: br000065 article-title: Understanding the complexity of induced subgraph isomorphisms publication-title: Automata, Languages and Programming – volume: 8 start-page: 161 year: 2012 end-page: 185 ident: br000180 article-title: Efficient triangle counting in large graphs via degree-based vertex partitioning publication-title: Internet Math. – volume: vol. 484 start-page: 18 year: 1990 end-page: 29 ident: br000200 article-title: Finding minimally weighted subgraphs publication-title: Graph-Theoretic Concepts in Computer Science, WG’90 – start-page: 391 year: 1984 end-page: 400 ident: br000210 article-title: On tape versus core an application of space efficient perfect hash functions to the invariance of space publication-title: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing (New York, NY, USA) – volume: vol. 3503 start-page: 606 year: 2005 end-page: 609 ident: br000215 article-title: Finding, counting and listing all triangles in large graphs, an experimental study publication-title: Experimental and Efficient Algorithms – volume: 52 start-page: 221 year: 2013 end-page: 270 ident: br000195 article-title: Parameterized random complexity publication-title: Theory of Comput. Syst. – volume: 8 start-page: 410 year: 1979 end-page: 421 ident: br000250 article-title: The complexity of enumeration and reliability problems publication-title: SIAM J. Comput. – volume: 54 start-page: 1:1 year: 2007 end-page: 1:24 ident: br000140 article-title: The complexity of homomorphism and constraint satisfaction problems seen from the other side publication-title: J. ACM – reference: C.E. Tsourakakis, Fast counting of triangles in large real networks without counting: Algorithms and laws, Data Mining, 2008. ICDM’08, in: Eighth IEEE International Conference on, Dec 2008, pp. 608–617. – volume: 2 start-page: 464 year: 1935 end-page: 470 ident: br000105 article-title: A combinatorial problem in geometry publication-title: Compos. Math. – start-page: 16 year: 2008 end-page: 24 ident: br000035 article-title: Efficient semi-streaming algorithms for local triangle counting in massive graphs publication-title: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24–27, 2008 – volume: 17 start-page: 260 year: 2000 end-page: 289 ident: br000100 article-title: The complexity of counting graph homomorphisms publication-title: Random Structures Algorithms – reference: Martin Grohe, Thomas Schwentick, Luc Segoufin, When is the evaluation of conjunctive queries tractable?, in: Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001, pp. 657–666. – volume: 33 start-page: 892 year: 2004 end-page: 922 ident: br000120 article-title: The parameterized complexity of counting problems publication-title: SIAM J. Comput. – volume: 81 start-page: 702 year: 2015 end-page: 716 ident: br000155 article-title: The parameterised complexity of counting connected subgraphs and graph motifs publication-title: J. Comput. System Sci. – reference: Bingkai Lin, The parameterized complexity of – volume: 31 start-page: 398 year: 2001 end-page: 427 ident: br000245 article-title: The complexity of counting in sparse, regular, and planar graphs publication-title: SIAM J. Comput. – reference: -Biclique, in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015, pp. 605–615. – reference: Mark Jerrum, Kitty Meeks, The parameterised complexity of counting even and odd induced subgraphs, 2014. – volume: 410 start-page: 53 year: 2009 end-page: 61 ident: br000115 article-title: On the parameterized complexity of multiple-interval graph problems publication-title: Theoret. Comput. Sci. – volume: vol. 5917 start-page: 1 year: 2009 end-page: 16 ident: br000005 article-title: Balanced hashing, color coding and approximate counting publication-title: Parameterized and Exact Computation – volume: 42 start-page: 831 year: 2013 end-page: 854 ident: br000255 article-title: Finding, minimizing, and counting weighted subgraphs publication-title: SIAM J. Comput. – reference: R.M. Karp, M. Luby, Monte-carlo algorithms for enumeration and reliability problems, in: Proeedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, 1983, pp. 56–64. – volume: 8 start-page: 1296 year: 2011 end-page: 1308 ident: br000040 article-title: Parameterized algorithmics for finding connected motifs in biological networks publication-title: IEEE/ACM Trans. Comput. Biol. Bioinformatics – volume: 329 start-page: 315 year: 2004 end-page: 323 ident: br000085 article-title: The complexity of counting homomorphisms seen from the other side publication-title: Theoret. Comput. Sci. – volume: 41 start-page: 92 year: 1986 end-page: 114 ident: br000205 article-title: Graph minors. V. Excluding a planar graph publication-title: J. Combin. Theory Ser. B – volume: 141 start-page: 109 year: 1995 end-page: 131 ident: br000090 article-title: Fixed-parameter tractability and completeness II: On completeness for W[1] publication-title: Theoret. Comput. Sci. – volume: 65 start-page: 828 year: 2013 end-page: 844 ident: br000150 article-title: Finding and counting vertex-colored subtrees publication-title: Algorithmica – reference: [math.CO]. – volume: 42 start-page: 844 year: 1995 end-page: 856 ident: br000015 article-title: Color-coding publication-title: J. ACM – volume: 191 start-page: 97 year: 1998 end-page: 115 ident: br000095 article-title: Parameterized circuit complexity and the W hierarchy publication-title: Theoret. Comput. Sci. – volume: vol. 4835 start-page: 632 year: 2007 end-page: 643 ident: br000110 article-title: Bounded tree-width and csp-related problems publication-title: Algorithms and Computation – volume: 384 start-page: 111 year: 2007 end-page: 125 ident: br000260 article-title: Computational complexity of counting problems on 3-regular planar graphs publication-title: Theoret. Comput. Sci. – reference: Ankit Chauhan, B.V. Raghavendra Rao, Parameterized analogues of probabilistic computation, 2014. – reference: Radu Curticapean, Dániel Marx, Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts, in: 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014, 2014. – year: 2006 ident: br000125 article-title: Parameterized Complexity Theory – volume: 289 start-page: 997 year: 2002 end-page: 1008 ident: br000175 article-title: Parameterized complexity of finding subgraphs with hereditary properties publication-title: Theoret. Comput. Sci. – volume: 19 start-page: 775 year: 1990 end-page: 786 ident: br000220 article-title: The spatial complexity of oblivious publication-title: SIAM J. Comput. – volume: 31 start-page: 538 year: 1984 end-page: 544 ident: br000130 article-title: Storing a sparse table with 0(1) worst case access time publication-title: J. ACM – volume: vol. 4835 start-page: 632 year: 2007 ident: 10.1016/j.dam.2015.06.019_br000110 article-title: Bounded tree-width and csp-related problems – volume: 329 start-page: 315 issue: 1–3 year: 2004 ident: 10.1016/j.dam.2015.06.019_br000085 article-title: The complexity of counting homomorphisms seen from the other side publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2004.08.008 – volume: 8 start-page: 161 issue: 1–2 year: 2012 ident: 10.1016/j.dam.2015.06.019_br000180 article-title: Efficient triangle counting in large graphs via degree-based vertex partitioning publication-title: Internet Math. doi: 10.1080/15427951.2012.625260 – volume: 41 start-page: 92 issue: 1 year: 1986 ident: 10.1016/j.dam.2015.06.019_br000205 article-title: Graph minors. V. Excluding a planar graph publication-title: J. Combin. Theory Ser. B doi: 10.1016/0095-8956(86)90030-4 – ident: 10.1016/j.dam.2015.06.019_br000240 doi: 10.1109/ICDM.2008.72 – start-page: 16 year: 2008 ident: 10.1016/j.dam.2015.06.019_br000035 article-title: Efficient semi-streaming algorithms for local triangle counting in massive graphs – volume: 19 start-page: 775 issue: 5 year: 1990 ident: 10.1016/j.dam.2015.06.019_br000220 article-title: The spatial complexity of oblivious k-probe hash functions publication-title: SIAM J. Comput. doi: 10.1137/0219054 – volume: 52 start-page: 221 issue: 2 year: 2013 ident: 10.1016/j.dam.2015.06.019_br000195 article-title: Parameterized random complexity publication-title: Theory of Comput. Syst. doi: 10.1007/s00224-011-9381-0 – volume: 42 start-page: 844 issue: 4 year: 1995 ident: 10.1016/j.dam.2015.06.019_br000015 article-title: Color-coding publication-title: J. ACM doi: 10.1145/210332.210337 – ident: 10.1016/j.dam.2015.06.019_br000055 – volume: 289 start-page: 997 issue: 2 year: 2002 ident: 10.1016/j.dam.2015.06.019_br000175 article-title: Parameterized complexity of finding subgraphs with hereditary properties publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(01)00414-5 – volume: vol. 5917 start-page: 1 year: 2009 ident: 10.1016/j.dam.2015.06.019_br000005 article-title: Balanced hashing, color coding and approximate counting – volume: 42 start-page: 831 issue: 3 year: 2013 ident: 10.1016/j.dam.2015.06.019_br000255 article-title: Finding, minimizing, and counting weighted subgraphs publication-title: SIAM J. Comput. doi: 10.1137/09076619X – ident: 10.1016/j.dam.2015.06.019_br000225 – ident: 10.1016/j.dam.2015.06.019_br000170 doi: 10.1109/SFCS.1983.35 – volume: 54 start-page: 1:1 issue: 1 year: 2007 ident: 10.1016/j.dam.2015.06.019_br000140 article-title: The complexity of homomorphism and constraint satisfaction problems seen from the other side publication-title: J. ACM doi: 10.1145/1206035.1206036 – volume: 410 start-page: 53 year: 2009 ident: 10.1016/j.dam.2015.06.019_br000115 article-title: On the parameterized complexity of multiple-interval graph problems publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2008.09.065 – volume: 33 start-page: 892 issue: 4 year: 2004 ident: 10.1016/j.dam.2015.06.019_br000120 article-title: The parameterized complexity of counting problems publication-title: SIAM J. Comput. doi: 10.1137/S0097539703427203 – volume: 26 start-page: 695 issue: 2 year: 2012 ident: 10.1016/j.dam.2015.06.019_br000025 article-title: Counting subgraphs via homomorphisms publication-title: SIAM J. Discrete Math. doi: 10.1137/100789403 – volume: 8 start-page: 1296 issue: 5 year: 2011 ident: 10.1016/j.dam.2015.06.019_br000040 article-title: Parameterized algorithmics for finding connected motifs in biological networks publication-title: IEEE/ACM Trans. Comput. Biol. Bioinformatics doi: 10.1109/TCBB.2011.19 – volume: 8 start-page: 410 issue: 3 year: 1979 ident: 10.1016/j.dam.2015.06.019_br000250 article-title: The complexity of enumeration and reliability problems publication-title: SIAM J. Comput. doi: 10.1137/0208032 – ident: 10.1016/j.dam.2015.06.019_br000165 – volume: 17 start-page: 260 issue: 3–4 year: 2000 ident: 10.1016/j.dam.2015.06.019_br000100 article-title: The complexity of counting graph homomorphisms publication-title: Random Structures Algorithms doi: 10.1002/1098-2418(200010/12)17:3/4<260::AID-RSA5>3.0.CO;2-W – volume: vol. 7965 start-page: 352 year: 2013 ident: 10.1016/j.dam.2015.06.019_br000075 article-title: Counting matchings of size k is #W[1]-hard – volume: 384 start-page: 111 issue: 1 year: 2007 ident: 10.1016/j.dam.2015.06.019_br000260 article-title: Computational complexity of counting problems on 3-regular planar graphs publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2007.05.023 – start-page: 391 year: 1984 ident: 10.1016/j.dam.2015.06.019_br000210 article-title: On tape versus core an application of space efficient perfect hash functions to the invariance of space – volume: 17 start-page: 209 issue: 3 year: 1997 ident: 10.1016/j.dam.2015.06.019_br000020 article-title: Finding and counting given length cycles publication-title: Algorithmica doi: 10.1007/BF02523189 – volume: 298 start-page: 824 issue: 5594 year: 2002 ident: 10.1016/j.dam.2015.06.019_br000190 article-title: Network motifs: Simple building blocks of complex networks publication-title: Science doi: 10.1126/science.298.5594.824 – volume: 14 start-page: 210 issue: 1 year: 1985 ident: 10.1016/j.dam.2015.06.019_br000070 article-title: Arboricity and subgraph listing algorithms publication-title: SIAM J. Comput. doi: 10.1137/0214017 – volume: 65 start-page: 828 issue: 4 year: 2013 ident: 10.1016/j.dam.2015.06.019_br000150 article-title: Finding and counting vertex-colored subtrees publication-title: Algorithmica doi: 10.1007/s00453-011-9600-8 – volume: 31 start-page: 538 issue: 3 year: 1984 ident: 10.1016/j.dam.2015.06.019_br000130 article-title: Storing a sparse table with 0(1) worst case access time publication-title: J. ACM doi: 10.1145/828.1884 – volume: vol. 5125 start-page: 587 year: 2008 ident: 10.1016/j.dam.2015.06.019_br000065 article-title: Understanding the complexity of induced subgraph isomorphisms – volume: vol. 5757 start-page: 578 year: 2009 ident: 10.1016/j.dam.2015.06.019_br000045 article-title: Counting paths and packings in halves – volume: 2 start-page: 464 year: 1935 ident: 10.1016/j.dam.2015.06.019_br000105 article-title: A combinatorial problem in geometry publication-title: Compos. Math. – volume: 81 start-page: 702 issue: 4 year: 2015 ident: 10.1016/j.dam.2015.06.019_br000155 article-title: The parameterised complexity of counting connected subgraphs and graph motifs publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2014.11.015 – volume: vol. 2518 start-page: 453 year: 2002 ident: 10.1016/j.dam.2015.06.019_br000030 article-title: Approximation algorithms for some parameterized counting problems – volume: vol. 484 start-page: 18 year: 1990 ident: 10.1016/j.dam.2015.06.019_br000200 article-title: Finding minimally weighted subgraphs – ident: 10.1016/j.dam.2015.06.019_br000080 doi: 10.1109/FOCS.2014.22 – volume: 191 start-page: 97 issue: 1–2 year: 1998 ident: 10.1016/j.dam.2015.06.019_br000095 article-title: Parameterized circuit complexity and the W hierarchy publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(96)00317-9 – ident: 10.1016/j.dam.2015.06.019_br000135 doi: 10.1109/ICOIN.2001.905436 – ident: 10.1016/j.dam.2015.06.019_br000145 doi: 10.1145/380752.380867 – start-page: 309 year: 2013 ident: 10.1016/j.dam.2015.06.019_br000060 article-title: The fine classification of conjunctive queries and parameterized logarithmic space complexity – volume: 141 start-page: 109 issue: 1–2 year: 1995 ident: 10.1016/j.dam.2015.06.019_br000090 article-title: Fixed-parameter tractability and completeness II: On completeness for W[1] publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(94)00097-3 – ident: 10.1016/j.dam.2015.06.019_br000230 – volume: 25 start-page: 183 issue: 4 year: 1995 ident: 10.1016/j.dam.2015.06.019_br000235 article-title: Recognizing small subgraphs publication-title: Networks doi: 10.1002/net.3230250404 – volume: vol. 7535 start-page: 171 year: 2012 ident: 10.1016/j.dam.2015.06.019_br000050 article-title: Weighted counting of k-matchings is #W[1]-hard – year: 2006 ident: 10.1016/j.dam.2015.06.019_br000125 – volume: 7 issue: 3 year: 2015 ident: 10.1016/j.dam.2015.06.019_br000160 article-title: Some hard families of parameterised counting problems publication-title: ACM Trans. Comput. Theory doi: 10.1145/2786017 – volume: 31 start-page: 398 issue: 2 year: 2001 ident: 10.1016/j.dam.2015.06.019_br000245 article-title: The complexity of counting in sparse, regular, and planar graphs publication-title: SIAM J. Comput. doi: 10.1137/S0097539797321602 – ident: 10.1016/j.dam.2015.06.019_br000185 doi: 10.1137/1.9781611973730.41 – volume: 6 start-page: 54:1 issue: 3 year: 2010 ident: 10.1016/j.dam.2015.06.019_br000010 article-title: Balanced families of perfect hash functions and their applications publication-title: ACM Trans. Algorithms doi: 10.1145/1798596.1798607 – volume: vol. 3503 start-page: 606 year: 2005 ident: 10.1016/j.dam.2015.06.019_br000215 article-title: Finding, counting and listing all triangles in large graphs, an experimental study |
| SSID | ssj0001218 ssj0000186 ssj0006644 |
| Score | 2.3585105 |
| Snippet | Parameterised subgraph counting problems are the most thoroughly studied topic in the theory of parameterised counting, and there has been significant recent... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 170 |
| SubjectTerms | Counting complexity FPTRAS Parameterised complexity Subgraph counting |
| Title | The challenges of unbounded treewidth in parameterised subgraph counting problems |
| URI | https://dx.doi.org/10.1016/j.dam.2015.06.019 |
| Volume | 198 |
| WOSCitedRecordID | wos000366786000015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6771 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001218 issn: 0166-218X databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LTxsxELYQ4UAPqOWhpi2VD5xAK8WxvY9j1FLRViCQQMpttX6stEAXRDbAz2f8TMJL5cDFWm1ib-JvNP48nv0GoR2wGQ37HpXAYsASlkuRCLCMRBSpSuu84nkqbbGJ7OgoH4-LY1_NfmLLCWRtm9_fF9fvCjXcA7DNq7NvgDsOCjfgGkCHFmCH9r-Bl6FEik3UmLbCFE8CammOoO8a1dkwh1H9_qetVjN8NJkKK169F6tH-Fozk3n--rMBNwN9Ins9jLKvkZwfan1hreNv0zmRkRBWIDas4BNMfaQxTRNY_8cLrtJVjPbOjriSH37dJK5Y8ROX7KID5_Ak8-I_4VYu1bvJBfnrR8tSTBYMeWjnJQxRmiFKk4tntF57w4wX4Mt6o9_74z9zsmFGE281BNpm50rAr5hXe3d_Lpxz24y_R7_weaYyxz5OP6I1v23AIwf3J7Sk23X0YW7yN9AJAI9nwOOrGkfgcQQeNy1eAB4H4HEAHgfgN9HZr_3THweJL5iRSMoGXZLVmZbDouIVpRKuc2C_XHI5qERdEAaNUGwgpQbeRxTlqiBCKM7qDFi7VopuoeX2qtWfEYZdbcUJ5UJnKRMkrahM6VBQUVMtZF710SBMTim9mrwpanJZvghXH-3GLtdOSuW1L7Mw46Xngo7jlWBXL3f78pZnfEWrM8v_hpa7m6neRivytmsmN9-9UT0AX-5-cg |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+challenges+of+unbounded+treewidth+in+parameterised+subgraph+counting+problems&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Meeks%2C+Kitty&rft.date=2016-01-10&rft.issn=0166-218X&rft.volume=198&rft.spage=170&rft.epage=194&rft_id=info:doi/10.1016%2Fj.dam.2015.06.019&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_dam_2015_06_019 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon |