The P3 infection time is W[1]-hard parameterized by the treewidth
Recent papers investigated the maximum infection times tP3(G), tgd(G) and tmo(G) of the P3 convexity, geodesic convexity and monophonic convexity, respectively. In [4] and [8], it was proved that deciding whether tgd(G)≥2 or tmo(G)≥2 are NP-Complete problems even for bipartite graphs. In [17], it wa...
Saved in:
| Published in | Information processing letters Vol. 132; pp. 55 - 61 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
01.04.2018
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | Recent papers investigated the maximum infection times tP3(G), tgd(G) and tmo(G) of the P3 convexity, geodesic convexity and monophonic convexity, respectively. In [4] and [8], it was proved that deciding whether tgd(G)≥2 or tmo(G)≥2 are NP-Complete problems even for bipartite graphs. In [17], it was proved that, in bipartite graphs, deciding whether tP3(G)≥k is polynomial time solvable for k≤4, but is NP-Complete for k≥5. In this paper, we prove that the P3 infection time problem is fixed parameter tractable parameterized by treewidth + k, but is W[1]-hard when parameterized only by the treewidth.
•P3 infection time is the maximum number of rounds needed to infect all vertices of a graph according to the P3 infection.•P3 infection time problem is W[1]-hard on the treewidth of the graph.•P3 infection time problem is fixed parameter tractable on the treewidth, if the time is fixed. |
|---|---|
| AbstractList | Recent papers investigated the maximum infection times tP3(G), tgd(G) and tmo(G) of the P3 convexity, geodesic convexity and monophonic convexity, respectively. In [4] and [8], it was proved that deciding whether tgd(G)≥2 or tmo(G)≥2 are NP-Complete problems even for bipartite graphs. In [17], it was proved that, in bipartite graphs, deciding whether tP3(G)≥k is polynomial time solvable for k≤4, but is NP-Complete for k≥5. In this paper, we prove that the P3 infection time problem is fixed parameter tractable parameterized by treewidth + k, but is W[1]-hard when parameterized only by the treewidth.
•P3 infection time is the maximum number of rounds needed to infect all vertices of a graph according to the P3 infection.•P3 infection time problem is W[1]-hard on the treewidth of the graph.•P3 infection time problem is fixed parameter tractable on the treewidth, if the time is fixed. |
| Author | Marcilon, Thiago Sampaio, Rudini |
| Author_xml | – sequence: 1 givenname: Thiago surname: Marcilon fullname: Marcilon, Thiago email: thiagomarcilon@lia.ufc.br – sequence: 2 givenname: Rudini orcidid: 0000-0001-5889-5183 surname: Sampaio fullname: Sampaio, Rudini email: rudini@lia.ufc.br |
| BookMark | eNp9kMFKAzEURYNUsK1-gLv8wIzvZaZJB1elqBUKuqi4EAlp8kJT2pmSBKV-vVPq2tXd3PN494zYoO1aYuwWoURAebctw2FXCkBVoigB5AUb4lSJQiI2AzYEEFAANnDFRiltoW_UlRqy2WpD_LXiofVkc-hansOeeEj8_QM_i42Jjh9MNHvKFMMPOb4-8twzORJ9B5c31-zSm12im78cs7fHh9V8USxfnp7ns2VhRaNy4aWsSAnvJq6RhioHzjgPDQkDykzNVNiq9qp2MFFWWtsYryTJ9aRGoYRZV2OG57s2dilF8voQw97Eo0bQJwd6q3sH-uRAo9D9wp65PzPUP_YVKOpkA7WWXIj9XO268A_9C09fZhw |
| CitedBy_id | crossref_primary_10_1016_j_procs_2021_11_014 crossref_primary_10_1016_j_dam_2023_06_004 |
| Cites_doi | 10.1016/j.tcs.2015.10.009 10.1016/j.dam.2014.09.012 10.1088/0022-3719/12/1/008 10.1016/j.dam.2008.09.012 10.1016/j.tcs.2008.09.065 10.1016/0890-5401(90)90043-H 10.1016/0095-8956(84)90013-3 10.1016/j.dam.2009.11.016 10.1016/j.ic.2010.11.026 10.1007/s10955-009-9899-6 10.1137/130941584 10.1016/j.ejc.2015.02.012 10.1090/S0002-9947-2011-05552-2 10.1007/s10955-010-0056-z 10.1006/jcss.2000.1727 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier B.V. |
| Copyright_xml | – notice: 2018 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ipl.2017.12.006 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-6119 |
| EndPage | 61 |
| ExternalDocumentID | 10_1016_j_ipl_2017_12_006 S002001901730220X |
| GrantInformation_xml | – fundername: FUNCAP grantid: 4543945/2016 funderid: https://doi.org/10.13039/501100005283 – fundername: CNPq grantid: 425297/2016-0 funderid: https://doi.org/10.13039/501100003593 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SME SPC SPCBC SSV SSZ T5K TN5 UQL WH7 WUQ XPP ZMT ZY4 ~G- AAXKI AAYXX AFJKZ AKRWK CITATION |
| ID | FETCH-LOGICAL-c297t-f663e72fd5d96ae3d0dadf09e2a07a8a82c34f74d057c6cc9af76e6b541272ab3 |
| IEDL.DBID | AIKHN |
| ISSN | 0020-0190 |
| IngestDate | Thu Sep 26 18:31:39 EDT 2024 Fri Feb 23 02:16:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | P3 convexity Computational complexity Infection time Fixed parameter tractability Treewidth |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c297t-f663e72fd5d96ae3d0dadf09e2a07a8a82c34f74d057c6cc9af76e6b541272ab3 |
| ORCID | 0000-0001-5889-5183 |
| PageCount | 7 |
| ParticipantIDs | crossref_primary_10_1016_j_ipl_2017_12_006 elsevier_sciencedirect_doi_10_1016_j_ipl_2017_12_006 |
| PublicationCentury | 2000 |
| PublicationDate | April 2018 2018-04-00 |
| PublicationDateYYYYMMDD | 2018-04-01 |
| PublicationDate_xml | – month: 04 year: 2018 text: April 2018 |
| PublicationDecade | 2010 |
| PublicationTitle | Information processing letters |
| PublicationYear | 2018 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Marcilon, Sampaio (br0180) 2016; vol. 9224 Lokshtanov, Marx, Saurabh (br0160) 2011; 105 Chalupa, Leath, Reich (br0070) 1979; 12 Marcilon, Nascimento, Sampaio (br0170) 2014; vol. 8747 Dreyer, Roberts (br0110) 2009; 157 Fellows, Hermelin, Rosamond, Vialette (br0130) 2009; 410 Courcelle (br0090) 1990; 85 Costa, Dourado, Sampaio (br0080) 2015; 197 Shakarian, Bhatnagar, Aleali, Shaabani, Guo (br0200) 2015 Benevides, Campos, Dourado, Sampaio, Silva (br0040) 2016; 609 Dourado, Protti, Szwarcfiter (br0100) 2010; 158 Amini (br0010) 2010; 141 Benevides, Campos, Dourado, Sampaio, Silva (br0030) 2015; 48 Fey, Levine, Peres (br0140) 2010; 138 Benevides, Przykucki (br0060) 2015; 29 van de Vel (br0210) 1993 Balogh, Bollobás, Duminil-Copin, Morris (br0020) 2012; 364 Impagliazzo, Paturi (br0150) 2001; 62 Fellows, Fomin, Lokshtanov, Rosamond, Saurabh, Szeider, Thomassen (br0120) 2011; 209 Benevides, Przykucki (br0050) 2013; 20 Robertson, Seymour (br0190) 1984; 36 Benevides (10.1016/j.ipl.2017.12.006_br0040) 2016; 609 Robertson (10.1016/j.ipl.2017.12.006_br0190) 1984; 36 Amini (10.1016/j.ipl.2017.12.006_br0010) 2010; 141 Marcilon (10.1016/j.ipl.2017.12.006_br0170) 2014; vol. 8747 van de Vel (10.1016/j.ipl.2017.12.006_br0210) 1993 Benevides (10.1016/j.ipl.2017.12.006_br0030) 2015; 48 Dourado (10.1016/j.ipl.2017.12.006_br0100) 2010; 158 Dreyer (10.1016/j.ipl.2017.12.006_br0110) 2009; 157 Fellows (10.1016/j.ipl.2017.12.006_br0130) 2009; 410 Fey (10.1016/j.ipl.2017.12.006_br0140) 2010; 138 Balogh (10.1016/j.ipl.2017.12.006_br0020) 2012; 364 Marcilon (10.1016/j.ipl.2017.12.006_br0180) 2016; vol. 9224 Lokshtanov (10.1016/j.ipl.2017.12.006_br0160) 2011; 105 Courcelle (10.1016/j.ipl.2017.12.006_br0090) 1990; 85 Impagliazzo (10.1016/j.ipl.2017.12.006_br0150) 2001; 62 Benevides (10.1016/j.ipl.2017.12.006_br0050) 2013; 20 Chalupa (10.1016/j.ipl.2017.12.006_br0070) 1979; 12 Fellows (10.1016/j.ipl.2017.12.006_br0120) 2011; 209 Shakarian (10.1016/j.ipl.2017.12.006_br0200) 2015 Costa (10.1016/j.ipl.2017.12.006_br0080) 2015; 197 Benevides (10.1016/j.ipl.2017.12.006_br0060) 2015; 29 |
| References_xml | – volume: 48 start-page: 88 year: 2015 end-page: 99 ident: br0030 article-title: The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects publication-title: Eur. J. Comb. contributor: fullname: Silva – volume: 12 start-page: 31 year: 1979 end-page: 35 ident: br0070 article-title: Bootstrap percolation on a Bethe lattice publication-title: J. Phys. C, Solid State Phys. contributor: fullname: Reich – volume: 85 start-page: 12 year: 1990 end-page: 75 ident: br0090 article-title: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs publication-title: Inf. Comput. contributor: fullname: Courcelle – volume: 29 start-page: 224 year: 2015 end-page: 251 ident: br0060 article-title: Maximum percolation time in two-dimensional bootstrap percolation publication-title: SIAM J. Discrete Math. contributor: fullname: Przykucki – volume: 62 start-page: 367 year: 2001 end-page: 375 ident: br0150 article-title: On the complexity of k-sat publication-title: J. Comput. Syst. Sci. contributor: fullname: Paturi – year: 1993 ident: br0210 article-title: Theory of Convex Structures, vol. 50 contributor: fullname: van de Vel – volume: 364 start-page: 2667 year: 2012 end-page: 2701 ident: br0020 article-title: The sharp threshold for bootstrap percolation in all dimensions publication-title: Trans. Am. Math. Soc. contributor: fullname: Morris – volume: 20 start-page: 1 year: 2013 end-page: 20 ident: br0050 article-title: On slowly percolating sets of minimal size in bootstrap percolation publication-title: Electron. J. Comb. contributor: fullname: Przykucki – volume: vol. 9224 start-page: 169 year: 2016 end-page: 185 ident: br0180 article-title: The maximum time of 2-neighbour bootstrap percolation in grid graphs and parameterized complexity results publication-title: WG'2015 Graph-Theoretic Concepts in Computer Science contributor: fullname: Sampaio – volume: 197 start-page: 70 year: 2015 end-page: 74 ident: br0080 article-title: Inapproximability results related to monophonic convexity publication-title: Discrete Appl. Math. contributor: fullname: Sampaio – volume: 138 start-page: 143 year: 2010 end-page: 159 ident: br0140 article-title: Growth rates and explosions in sandpiles publication-title: J. Stat. Phys. contributor: fullname: Peres – volume: 609 start-page: 287 year: 2016 end-page: 295 ident: br0040 article-title: The maximum infection time in the geodesic and monophonic convexities publication-title: Theor. Comput. Sci. contributor: fullname: Silva – volume: 158 start-page: 1268 year: 2010 end-page: 1274 ident: br0100 article-title: Complexity results related to monophonic convexity publication-title: Discrete Appl. Math. contributor: fullname: Szwarcfiter – volume: 410 start-page: 53 year: 2009 end-page: 61 ident: br0130 article-title: On the parameterized complexity of multiple-interval graph problems publication-title: Theor. Comput. Sci. contributor: fullname: Vialette – volume: 36 start-page: 49 year: 1984 end-page: 64 ident: br0190 article-title: Graph minors III: planar tree-width publication-title: J. Comb. Theory, Ser. B contributor: fullname: Seymour – year: 2015 ident: br0200 article-title: Diffusion in Social Networks contributor: fullname: Guo – volume: 141 start-page: 459 year: 2010 end-page: 475 ident: br0010 article-title: Bootstrap percolation in living neural networks publication-title: J. Stat. Phys. contributor: fullname: Amini – volume: 157 start-page: 1615 year: 2009 end-page: 1627 ident: br0110 article-title: Irreversible k-threshold processes: graph-theoretical threshold models of the spread of disease and of opinion publication-title: Discrete Appl. Math. contributor: fullname: Roberts – volume: 209 start-page: 143 year: 2011 end-page: 153 ident: br0120 article-title: On the complexity of some colorful problems parameterized by treewidth publication-title: Inf. Comput. contributor: fullname: Thomassen – volume: 105 start-page: 41 year: 2011 end-page: 72 ident: br0160 article-title: Lower bounds based on the exponential time hypothesis publication-title: Bull. Eur. Assoc. Theor. Comput. Sci. contributor: fullname: Saurabh – volume: vol. 8747 start-page: 372 year: 2014 end-page: 383 ident: br0170 article-title: The maximum time of 2-neighbour bootstrap percolation: complexity results publication-title: WG'2014 Graph-Theoretic Concepts in Computer Science contributor: fullname: Sampaio – volume: 609 start-page: 287 year: 2016 ident: 10.1016/j.ipl.2017.12.006_br0040 article-title: The maximum infection time in the geodesic and monophonic convexities publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2015.10.009 contributor: fullname: Benevides – volume: 105 start-page: 41 year: 2011 ident: 10.1016/j.ipl.2017.12.006_br0160 article-title: Lower bounds based on the exponential time hypothesis publication-title: Bull. Eur. Assoc. Theor. Comput. Sci. contributor: fullname: Lokshtanov – volume: 197 start-page: 70 year: 2015 ident: 10.1016/j.ipl.2017.12.006_br0080 article-title: Inapproximability results related to monophonic convexity publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2014.09.012 contributor: fullname: Costa – year: 1993 ident: 10.1016/j.ipl.2017.12.006_br0210 contributor: fullname: van de Vel – volume: 12 start-page: 31 issue: 1 year: 1979 ident: 10.1016/j.ipl.2017.12.006_br0070 article-title: Bootstrap percolation on a Bethe lattice publication-title: J. Phys. C, Solid State Phys. doi: 10.1088/0022-3719/12/1/008 contributor: fullname: Chalupa – volume: 157 start-page: 1615 issue: 7 year: 2009 ident: 10.1016/j.ipl.2017.12.006_br0110 article-title: Irreversible k-threshold processes: graph-theoretical threshold models of the spread of disease and of opinion publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2008.09.012 contributor: fullname: Dreyer – volume: 410 start-page: 53 issue: 1 year: 2009 ident: 10.1016/j.ipl.2017.12.006_br0130 article-title: On the parameterized complexity of multiple-interval graph problems publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.09.065 contributor: fullname: Fellows – volume: 85 start-page: 12 issue: 1 year: 1990 ident: 10.1016/j.ipl.2017.12.006_br0090 article-title: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs publication-title: Inf. Comput. doi: 10.1016/0890-5401(90)90043-H contributor: fullname: Courcelle – volume: 36 start-page: 49 issue: 1 year: 1984 ident: 10.1016/j.ipl.2017.12.006_br0190 article-title: Graph minors III: planar tree-width publication-title: J. Comb. Theory, Ser. B doi: 10.1016/0095-8956(84)90013-3 contributor: fullname: Robertson – volume: 158 start-page: 1268 issue: 12 year: 2010 ident: 10.1016/j.ipl.2017.12.006_br0100 article-title: Complexity results related to monophonic convexity publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2009.11.016 contributor: fullname: Dourado – volume: 209 start-page: 143 issue: 2 year: 2011 ident: 10.1016/j.ipl.2017.12.006_br0120 article-title: On the complexity of some colorful problems parameterized by treewidth publication-title: Inf. Comput. doi: 10.1016/j.ic.2010.11.026 contributor: fullname: Fellows – volume: 138 start-page: 143 issue: 1–3 year: 2010 ident: 10.1016/j.ipl.2017.12.006_br0140 article-title: Growth rates and explosions in sandpiles publication-title: J. Stat. Phys. doi: 10.1007/s10955-009-9899-6 contributor: fullname: Fey – volume: 29 start-page: 224 issue: 1 year: 2015 ident: 10.1016/j.ipl.2017.12.006_br0060 article-title: Maximum percolation time in two-dimensional bootstrap percolation publication-title: SIAM J. Discrete Math. doi: 10.1137/130941584 contributor: fullname: Benevides – volume: 48 start-page: 88 year: 2015 ident: 10.1016/j.ipl.2017.12.006_br0030 article-title: The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects publication-title: Eur. J. Comb. doi: 10.1016/j.ejc.2015.02.012 contributor: fullname: Benevides – volume: vol. 8747 start-page: 372 year: 2014 ident: 10.1016/j.ipl.2017.12.006_br0170 article-title: The maximum time of 2-neighbour bootstrap percolation: complexity results contributor: fullname: Marcilon – year: 2015 ident: 10.1016/j.ipl.2017.12.006_br0200 contributor: fullname: Shakarian – volume: 364 start-page: 2667 issue: 5 year: 2012 ident: 10.1016/j.ipl.2017.12.006_br0020 article-title: The sharp threshold for bootstrap percolation in all dimensions publication-title: Trans. Am. Math. Soc. doi: 10.1090/S0002-9947-2011-05552-2 contributor: fullname: Balogh – volume: vol. 9224 start-page: 169 year: 2016 ident: 10.1016/j.ipl.2017.12.006_br0180 article-title: The maximum time of 2-neighbour bootstrap percolation in grid graphs and parameterized complexity results contributor: fullname: Marcilon – volume: 141 start-page: 459 issue: 3 year: 2010 ident: 10.1016/j.ipl.2017.12.006_br0010 article-title: Bootstrap percolation in living neural networks publication-title: J. Stat. Phys. doi: 10.1007/s10955-010-0056-z contributor: fullname: Amini – volume: 62 start-page: 367 year: 2001 ident: 10.1016/j.ipl.2017.12.006_br0150 article-title: On the complexity of k-sat publication-title: J. Comput. Syst. Sci. doi: 10.1006/jcss.2000.1727 contributor: fullname: Impagliazzo – volume: 20 start-page: 1 issue: 2 year: 2013 ident: 10.1016/j.ipl.2017.12.006_br0050 article-title: On slowly percolating sets of minimal size in bootstrap percolation publication-title: Electron. J. Comb. contributor: fullname: Benevides |
| SSID | ssj0006437 |
| Score | 2.2306705 |
| Snippet | Recent papers investigated the maximum infection times tP3(G), tgd(G) and tmo(G) of the P3 convexity, geodesic convexity and monophonic convexity,... |
| SourceID | crossref elsevier |
| SourceType | Aggregation Database Publisher |
| StartPage | 55 |
| SubjectTerms | [formula omitted] convexity Computational complexity Fixed parameter tractability Infection time Treewidth |
| Title | The P3 infection time is W[1]-hard parameterized by the treewidth |
| URI | https://dx.doi.org/10.1016/j.ipl.2017.12.006 |
| Volume | 132 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB72cfHiW1wfSw6ehLptmqbtcVlcVsXFg4sLIiFNUqxgXbQievC3O-ljUdCL9NRCoHxJv5n0-yYDcMSMopHiFLclKnCYpJ4TIVk6bhIz7WEE1q4tFL6c8smMnc-DeQtGTS2MtVXW3F9xesnW9ZNBjeZgkWW2xtf6gTCe4SKl1J23oVuKRB3oDs8uJtMlIVttqnJ6WA9WvBQ3S5tXtrAChBeWPwVt36PfwtO3kDNeh9U6VyTD6nU2oGXyTVhr-jCQ-rPcgiHONbnySWOsyontGE-yF3Jz6905tq6K2CO-H631JfswmiTvBBM_YhXpt0wX99swG59ejyZO3RrBUTQOCyfFRMGENNWBjrk0vna11KkbGyrdUEYyospnaYhIB6HiSsUyDbnhScA8GlKZ-DvQyZ9yswtEa9w0ceb6qe8zZpIk4EabAC9NY015D44bRMSiOgFDNNawB4HwCQuf8KhA-HrAGszEj2kUyNB_D9v737B9WMG7qDLSHECneH41h5gjFEkf2iefXr9eCV-OA7nG |
| link.rule.ids | 315,783,787,4511,24130,27938,27939,45599,45693 |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB5qPejFt1ife_AkRJPNZjc5lmKp2hYPLRZElmR3gxGMRSOiB3-7s03iA_QiuSUshG8n38xmvpkBOGRG0VBxiscSFTgspp4TIlk6bhIx7aEH1q4tFB4MeW_MzifBpAGduhbGyior7i85fcbW1Z2TCs2TaZbZGl-rB0J_hkZKqTuZg3lm-2ehUR-_f-k8bGaq1HlYBVb0mdqcibyyqU0_eGL2S9BOPfrNOX1zON0VWKoiRdIuX2YVGiZfg-V6CgOpPsp1aONOk0uf1LKqnNh58SR7IlfX3o1jq6qIbfB9b4Uv2ZvRJHklGPYRm49-yXRxuwHj7umo03OqwQiOopEonBTDBCNoqgMd8dj42tWxTt3I0NgVcRiHVPksFYhzIBRXKopTwQ1PAuZRQePE34Rm_pCbLSBa45GJM9dPfZ8xkyQBN9oEeGkaacpbcFQjIqdl_wtZC8PuJMInLXzSoxLhawGrMZM_NlEiP_-9bPt_yw5goTca9GX_bHixA4v4JCwlNbvQLB6fzR5GC0WyP7OGD0bvuqg |
| 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+P3+infection+time+is+W%5B1%5D-hard+parameterized+by+the+treewidth&rft.jtitle=Information+processing+letters&rft.au=Marcilon%2C+Thiago&rft.au=Sampaio%2C+Rudini&rft.date=2018-04-01&rft.issn=0020-0190&rft.volume=132&rft.spage=55&rft.epage=61&rft_id=info:doi/10.1016%2Fj.ipl.2017.12.006&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ipl_2017_12_006 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon |