Exploring the gap between treedepth and vertex cover through vertex integrity
For problems intractable on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained algorithmic and complexity results. Although the studies in this direction are successful, we still need a systematic way for further investigations b...
Saved in:
| Published in | Theoretical computer science Vol. 918; pp. 60 - 76 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
29.05.2022
|
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | For problems intractable on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained algorithmic and complexity results. Although the studies in this direction are successful, we still need a systematic way for further investigations because the graphs of bounded vertex cover number form a rather small subclass of graphs of bounded treedepth. To fill this gap, we use another graph parameter, vertex integrity, which is placed between the two parameters mentioned above. For several graph problems, we generalize fixed-parameter tractability results parameterized by vertex cover number to the ones parameterized by vertex integrity. We also show some finer complexity contrasts by showing hardness with respect to vertex integrity or treedepth. |
|---|---|
| AbstractList | For problems intractable on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained algorithmic and complexity results. Although the studies in this direction are successful, we still need a systematic way for further investigations because the graphs of bounded vertex cover number form a rather small subclass of graphs of bounded treedepth. To fill this gap, we use another graph parameter, vertex integrity, which is placed between the two parameters mentioned above. For several graph problems, we generalize fixed-parameter tractability results parameterized by vertex cover number to the ones parameterized by vertex integrity. We also show some finer complexity contrasts by showing hardness with respect to vertex integrity or treedepth. |
| Author | Kobayashi, Yasuaki Kiyomi, Masashi Gima, Tatsuya Hanaka, Tesshu Otachi, Yota |
| Author_xml | – sequence: 1 givenname: Tatsuya surname: Gima fullname: Gima, Tatsuya email: gima@nagoya-u.jp organization: Nagoya University, Nagoya, Japan – sequence: 2 givenname: Tesshu orcidid: 0000-0001-6943-856X surname: Hanaka fullname: Hanaka, Tesshu email: hanaka@nagoya-u.jp organization: Nagoya University, Nagoya, Japan – sequence: 3 givenname: Masashi surname: Kiyomi fullname: Kiyomi, Masashi email: kiyomi@st.seikei.ac.jp organization: Seikei University, Musashino, Tokyo, Japan – sequence: 4 givenname: Yasuaki orcidid: 0000-0003-3244-6915 surname: Kobayashi fullname: Kobayashi, Yasuaki email: koba@ist.hokudai.ac.jp organization: Hokkaido University, Sapporo, Japan – sequence: 5 givenname: Yota orcidid: 0000-0002-0087-853X surname: Otachi fullname: Otachi, Yota email: otachi@nagoya-u.jp organization: Nagoya University, Nagoya, Japan |
| BookMark | eNp9kE1OwzAQRi1UJNrCAdj5Agm248SJWKGq_EhFbGBtOfYkdVXsyDGlvT2uChsWnc2MRt8bad4MTZx3gNAtJTkltLrb5FGPOSOM5aTICaMXaEpr0WSMNXyCpqQgPCsaUV6h2ThuSKpSVFP0utwPWx-s63FcA-7VgFuI3wAOxwBgYIhrrJzBOwgR9lj7NKRo8F_9-m9pXYQ-2Hi4Rped2o5w89vn6ONx-b54zlZvTy-Lh1WmWSNi1nasJERXqjac17pQvGPUMGh1STvBGa-5IC2rOadClJRT3UBLOwKVSWHTFnNET3d18OMYoJNDsJ8qHCQl8uhDbmTyIY8-JClk8pEY8Y_RNqpovYtB2e1Z8v5EQnppZyHIUVtwGowNoKM03p6hfwDNc330 |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2024_114954 crossref_primary_10_1016_j_tcs_2025_115092 crossref_primary_10_1137_22M1510911 crossref_primary_10_1145_3723880 crossref_primary_10_1007_s00453_025_01300_4 crossref_primary_10_1016_j_dam_2025_02_004 |
| Cites_doi | 10.1145/1435375.1435385 10.1016/j.ic.2010.11.026 10.1016/j.jcss.2012.04.004 10.1007/s002249910009 10.1016/j.tcs.2010.06.026 10.1093/comjnl/bxm052 10.1016/j.dam.2004.12.001 10.1137/0607057 10.1016/0196-6774(91)90006-K 10.1016/S0304-3975(03)00238-X 10.1051/ita/1992260302571 10.1007/s00453-018-0408-7 10.1016/j.ipl.2013.11.007 10.1287/moor.12.3.415 10.1145/1877714.1877718 10.1137/16M1057383 10.1016/j.dam.2016.11.016 10.1287/moor.8.4.538 10.1016/j.ic.2016.08.001 10.1016/j.ipl.2013.06.010 10.1007/s00453-016-0127-x 10.1137/0602041 10.1007/BF02579200 10.1137/S0097539701385351 10.1016/j.tcs.2010.10.043 10.1016/j.jda.2009.05.002 10.1016/j.dam.2010.11.003 10.1007/978-3-642-27875-4 10.1007/s00453-020-00737-z |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier B.V. |
| Copyright_xml | – notice: 2022 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2022.03.021 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 76 |
| ExternalDocumentID | 10_1016_j_tcs_2022_03_021 S030439752200161X |
| GrantInformation_xml | – fundername: JSPS grantid: JP18H04091; JP18K11168; JP18K11169; JP19K21537; JP20K19742; JP20H05793; JP21K11752; JP21K17707 funderid: https://doi.org/10.13039/501100001691 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW T5K TN5 WH7 YNT ZMT ~G- 29Q AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AEXQZ AFJKZ AFPUW AFXIZ AGCQF AGHFR AGQPQ AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN BNPGV CITATION EJD FGOYB G-2 HZ~ R2- RIG SEW SSH SSZ TAE WUQ XJT ZY4 |
| ID | FETCH-LOGICAL-c297t-bf2500c6a8d448c3a4f21d2ebc51f74248470b28441775141c9eb1f0e6dc3adb3 |
| IEDL.DBID | .~1 |
| ISSN | 0304-3975 |
| IngestDate | Tue Jul 01 03:43:10 EDT 2025 Thu Apr 24 22:55:18 EDT 2025 Fri Feb 23 02:39:42 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Vertex integrity Vertex cover number Treedepth |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c297t-bf2500c6a8d448c3a4f21d2ebc51f74248470b28441775141c9eb1f0e6dc3adb3 |
| ORCID | 0000-0003-3244-6915 0000-0002-0087-853X 0000-0001-6943-856X |
| PageCount | 17 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2022_03_021 crossref_citationtrail_10_1016_j_tcs_2022_03_021 elsevier_sciencedirect_doi_10_1016_j_tcs_2022_03_021 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2022-05-29 |
| PublicationDateYYYYMMDD | 2022-05-29 |
| PublicationDate_xml | – month: 05 year: 2022 text: 2022-05-29 day: 29 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Corneil, Rotics (br0160) 2005; 34 Szeider (br0510) 2011; 12 Bonnet, Purohit (br0130) 2019; vol. 148 Fiala, Golovach, Kratochvíl (br0280) 2011; 412 Bodlaender, Hanaka, Kobayashi, Kobayashi, Okamoto, Otachi, van der Zanden (br0120) 2020; 82 Asahiro, Miyano, Ono (br0030) 2011; 159 Belmonte, Kim, Lampis, Mitsou, Otachi (br0080) 2020; vol. 173 Dvořák, Eiben, Ganian, Knop, Ordyniak (br0230) 2017 Belmonte, Hanaka, Katsikarelis, Kim, Lampis (br0070) 2018; vol. 117 Chen, Kanj, Xia (br0150) 2010; 411 Garey, Johnson (br0340) 1979 Gassner (br0350) 2010; 8 Dvořák, Knop (br0240) 2018; 80 Oum (br0480) 2008; 5 Barefoot, Entringer, Swart (br0050) 1987; 1 Bonnet, Sikora (br0140) 2017; 231 Bodlaender (br0100) 1988; vol. 317 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh (br0190) 2015 Kellerhals, Koana (br0390) 2020; vol. 180 Drange, Dregi, van 't Hof (br0220) 2016; 76 Lokshtanov (br0410) 2015 Dom, Lokshtanov, Saurabh, Villanger (br0200) 2008; vol. 5018 Belmonte, Fomin, Golovach, Ramanujan (br0060) 2017; 31 Bodlaender, Hanaka, Jaffke, Ono, Otachi, van der Zanden (br0110) 2020 Downey, Fellows (br0210) 1999 Fellows, Lokshtanov, Misra, Rosamond, Saurabh (br0270) 2008; vol. 5369 Reidl, Rossmanith, Sánchez Villaamil, Sikdar (br0490) 2014; vol. 8572 Lokshtanov, Misra, Saurabh (br0420) 2013; 113 Biedl, Chan, Ganjali, Hajiaghayi, Wood (br0090) 2005; 148 Nešetřil, Ossona de Mendez (br0470) 2012 Courcelle, Makowsky, Rotics (br0180) 2000; 33 Misra, Mittal (br0440) 2020; vol. 12273 Abu-Khzam (br0010) 2014; 114 Kannan (br0380) 1987; 12 Courcelle (br0170) 1992; 26 Ganian, Klute, Ordyniak (br0330) 2020 Fellows, Fomin, Lokshtanov, Rosamond, Saurabh, Szeider, Thomassen (br0260) 2011; 209 Szeider (br0500) 2010; vol. 13 Gabow (br0300) 1983 Enciso, Fellows, Guo, Kanj, Rosamond, Suchý (br0250) 2009; vol. 5917 Monien (br0450) 1986; 7 Frank, Tardos (br0290) 1987; 7 Ganian (br0320) 2012 Assmann, Peck, Sysło, Zak (br0040) 1981; 2 Jansen, Kratsch, Marx, Schlotter (br0370) 2013; 79 Ganian (br0310) 2011; vol. 7112 Hlinený, Oum, Seese, Gottlob (br0360) 2008; 51 Lenstra (br0400) 1983; 8 Meeks, Scott (br0430) 2016; 251 Muradian (br0460) 2003; 307 Arnborg, Lagergren, Seese (br0020) 1991; 12 Enciso (10.1016/j.tcs.2022.03.021_br0250) 2009; vol. 5917 Biedl (10.1016/j.tcs.2022.03.021_br0090) 2005; 148 Muradian (10.1016/j.tcs.2022.03.021_br0460) 2003; 307 Abu-Khzam (10.1016/j.tcs.2022.03.021_br0010) 2014; 114 Arnborg (10.1016/j.tcs.2022.03.021_br0020) 1991; 12 Corneil (10.1016/j.tcs.2022.03.021_br0160) 2005; 34 Dom (10.1016/j.tcs.2022.03.021_br0200) 2008; vol. 5018 Misra (10.1016/j.tcs.2022.03.021_br0440) 2020; vol. 12273 Gabow (10.1016/j.tcs.2022.03.021_br0300) 1983 Nešetřil (10.1016/j.tcs.2022.03.021_br0470) 2012 Reidl (10.1016/j.tcs.2022.03.021_br0490) 2014; vol. 8572 Asahiro (10.1016/j.tcs.2022.03.021_br0030) 2011; 159 Ganian (10.1016/j.tcs.2022.03.021_br0330) 2020 Jansen (10.1016/j.tcs.2022.03.021_br0370) 2013; 79 Ganian (10.1016/j.tcs.2022.03.021_br0310) 2011; vol. 7112 Lokshtanov (10.1016/j.tcs.2022.03.021_br0420) 2013; 113 Szeider (10.1016/j.tcs.2022.03.021_br0510) 2011; 12 Drange (10.1016/j.tcs.2022.03.021_br0220) 2016; 76 Oum (10.1016/j.tcs.2022.03.021_br0480) 2008; 5 Fellows (10.1016/j.tcs.2022.03.021_br0270) 2008; vol. 5369 Hlinený (10.1016/j.tcs.2022.03.021_br0360) 2008; 51 Lenstra (10.1016/j.tcs.2022.03.021_br0400) 1983; 8 Belmonte (10.1016/j.tcs.2022.03.021_br0070) 2018; vol. 117 Dvořák (10.1016/j.tcs.2022.03.021_br0230) 2017 Frank (10.1016/j.tcs.2022.03.021_br0290) 1987; 7 Courcelle (10.1016/j.tcs.2022.03.021_br0170) 1992; 26 Dvořák (10.1016/j.tcs.2022.03.021_br0240) 2018; 80 Gassner (10.1016/j.tcs.2022.03.021_br0350) 2010; 8 Bodlaender (10.1016/j.tcs.2022.03.021_br0120) 2020; 82 Bonnet (10.1016/j.tcs.2022.03.021_br0140) 2017; 231 Lokshtanov (10.1016/j.tcs.2022.03.021_br0410) Fiala (10.1016/j.tcs.2022.03.021_br0280) 2011; 412 Barefoot (10.1016/j.tcs.2022.03.021_br0050) 1987; 1 Belmonte (10.1016/j.tcs.2022.03.021_br0080) 2020; vol. 173 Bodlaender (10.1016/j.tcs.2022.03.021_br0100) 1988; vol. 317 Assmann (10.1016/j.tcs.2022.03.021_br0040) 1981; 2 Kannan (10.1016/j.tcs.2022.03.021_br0380) 1987; 12 Meeks (10.1016/j.tcs.2022.03.021_br0430) 2016; 251 Ganian (10.1016/j.tcs.2022.03.021_br0320) Kellerhals (10.1016/j.tcs.2022.03.021_br0390) 2020; vol. 180 Fellows (10.1016/j.tcs.2022.03.021_br0260) 2011; 209 Downey (10.1016/j.tcs.2022.03.021_br0210) 1999 Monien (10.1016/j.tcs.2022.03.021_br0450) 1986; 7 Chen (10.1016/j.tcs.2022.03.021_br0150) 2010; 411 Courcelle (10.1016/j.tcs.2022.03.021_br0180) 2000; 33 Cygan (10.1016/j.tcs.2022.03.021_br0190) 2015 Garey (10.1016/j.tcs.2022.03.021_br0340) 1979 Belmonte (10.1016/j.tcs.2022.03.021_br0060) 2017; 31 Bodlaender (10.1016/j.tcs.2022.03.021_br0110) 2020 Bonnet (10.1016/j.tcs.2022.03.021_br0130) 2019; vol. 148 Szeider (10.1016/j.tcs.2022.03.021_br0500) 2010; vol. 13 |
| References_xml | – volume: 231 start-page: 78 year: 2017 end-page: 94 ident: br0140 article-title: The graph motif problem parameterized by the structure of the input graph publication-title: Discrete Appl. Math. – volume: vol. 12273 start-page: 162 year: 2020 end-page: 173 ident: br0440 article-title: Imbalance parameterized by twin cover revisited publication-title: COCOON 2020 – volume: 2 start-page: 387 year: 1981 end-page: 393 ident: br0040 article-title: The bandwidth of caterpillars with hairs of length 1 and 2 publication-title: SIAM J. Algebraic Discrete Methods – volume: 1 start-page: 13 year: 1987 end-page: 22 ident: br0050 article-title: Vulnerability in graphs — a comparative survey publication-title: J. Comb. Math. Comb. Comput. – year: 2020 ident: br0330 article-title: On structural parameterizations of the bounded-degree vertex deletion problem publication-title: Algorithmica – volume: 159 start-page: 498 year: 2011 end-page: 508 ident: br0030 article-title: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree publication-title: Discrete Appl. Math. – volume: vol. 180 year: 2020 ident: br0390 article-title: Parameterized complexity of geodetic set publication-title: IPEC 2020 – volume: 411 start-page: 3736 year: 2010 end-page: 3756 ident: br0150 article-title: Improved upper bounds for vertex cover publication-title: Theor. Comput. Sci. – volume: vol. 13 start-page: 179 year: 2010 ident: br0500 article-title: Not so easy problems for tree decomposable graphs publication-title: Ramanujan Mathematical Society – volume: 148 start-page: 27 year: 2005 end-page: 48 ident: br0090 article-title: Balanced vertex-orderings of graphs publication-title: Discrete Appl. Math. – year: 2012 ident: br0470 article-title: Sparsity: Graphs, Structures, and Algorithms publication-title: Algorithms and Combinatorics – volume: vol. 5917 start-page: 122 year: 2009 end-page: 133 ident: br0250 article-title: What makes equitable connected partition easy publication-title: IWPEC 2009 – start-page: 607 year: 2017 end-page: 613 ident: br0230 article-title: Solving integer linear programs with a small number of global variables and constraints publication-title: IJCAI 2017 – volume: 34 start-page: 825 year: 2005 end-page: 847 ident: br0160 article-title: On the relationship between clique-width and treewidth publication-title: SIAM J. Comput. – volume: 251 start-page: 91 year: 2016 end-page: 103 ident: br0430 article-title: The parameterised complexity of list problems on graphs of bounded treewidth publication-title: Inf. Comput. – year: 2015 ident: br0410 article-title: Parameterized integer quadratic programming: variables and coefficients – volume: 12 start-page: 308 year: 1991 end-page: 340 ident: br0020 article-title: Easy problems for tree-decomposable graphs publication-title: J. Algorithms – volume: vol. 173 year: 2020 ident: br0080 article-title: Grundy distinguishes treewidth from pathwidth publication-title: ESA 2020 – volume: vol. 317 start-page: 105 year: 1988 end-page: 118 ident: br0100 article-title: Dynamic programming on graphs with bounded treewidth publication-title: ICALP 1988 – start-page: 1777 year: 2020 end-page: 1779 ident: br0110 article-title: Hedonic seat arrangement problems (extended abstract) publication-title: AAMAS 2020 – volume: 8 start-page: 538 year: 1983 end-page: 548 ident: br0400 article-title: Integer programming with a fixed number of variables publication-title: Math. Oper. Res. – volume: 80 start-page: 3597 year: 2018 end-page: 3617 ident: br0240 article-title: Parameterized complexity of length-bounded cuts and multicuts publication-title: Algorithmica – volume: 12 year: 2011 ident: br0510 article-title: Monadic second order logic on graphs with local cardinality constraints publication-title: ACM Trans. Comput. Log. – volume: vol. 5018 start-page: 78 year: 2008 end-page: 90 ident: br0200 article-title: Capacitated domination and covering: a parameterized perspective publication-title: IWPEC 2008 – volume: 412 start-page: 2513 year: 2011 end-page: 2523 ident: br0280 article-title: Parameterized complexity of coloring problems: treewidth versus vertex cover publication-title: Theor. Comput. Sci. – year: 1979 ident: br0340 article-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – start-page: 448 year: 1983 end-page: 456 ident: br0300 article-title: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems publication-title: STOC 1983 – volume: 33 start-page: 125 year: 2000 end-page: 150 ident: br0180 article-title: Linear time solvable optimization problems on graphs of bounded clique-width publication-title: Theory Comput. Syst. – year: 2012 ident: br0320 article-title: Using neighborhood diversity to solve hard problems – volume: 307 start-page: 567 year: 2003 end-page: 572 ident: br0460 article-title: The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete publication-title: Theor. Comput. Sci. – volume: 82 start-page: 3566 year: 2020 end-page: 3587 ident: br0120 article-title: Subgraph isomorphism on graph classes that exclude a substructure publication-title: Algorithmica – year: 1999 ident: br0210 article-title: Parameterized Complexity – volume: 113 start-page: 714 year: 2013 end-page: 718 ident: br0420 article-title: Imbalance is fixed parameter tractable publication-title: Inf. Process. Lett. – volume: 26 start-page: 257 year: 1992 end-page: 286 ident: br0170 article-title: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues publication-title: RAIRO Theor. Inform. Appl. – volume: vol. 7112 start-page: 259 year: 2011 end-page: 271 ident: br0310 article-title: Twin-cover: beyond vertex cover in parameterized algorithmics publication-title: IPEC 2011 – year: 2015 ident: br0190 article-title: Parameterized Algorithms – volume: 51 start-page: 326 year: 2008 end-page: 362 ident: br0360 article-title: Width parameters beyond tree-width and their applications publication-title: Comput. J. – volume: 209 start-page: 143 year: 2011 end-page: 153 ident: br0260 article-title: On the complexity of some colorful problems parameterized by treewidth publication-title: Inf. Comput. – volume: vol. 148 year: 2019 ident: br0130 article-title: Metric dimension parameterized by treewidth publication-title: IPEC 2019 – volume: vol. 117 year: 2018 ident: br0070 article-title: New results on directed edge dominating set publication-title: MFCS 2018 – volume: vol. 8572 start-page: 931 year: 2014 end-page: 942 ident: br0490 article-title: A faster parameterized algorithm for treedepth publication-title: ICALP 2014 – volume: 12 start-page: 415 year: 1987 end-page: 440 ident: br0380 article-title: Minkowski's convex body theorem and integer programming publication-title: Math. Oper. Res. – volume: 7 start-page: 505 year: 1986 end-page: 512 ident: br0450 article-title: The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete publication-title: SIAM J. Algebraic Discrete Methods – volume: vol. 5369 start-page: 294 year: 2008 end-page: 305 ident: br0270 article-title: Graph layout problems parameterized by vertex cover publication-title: ISAAC 2008 – volume: 7 start-page: 49 year: 1987 end-page: 65 ident: br0290 article-title: An application of simultaneous diophantine approximation in combinatorial optimization publication-title: Combinatorica – volume: 8 start-page: 154 year: 2010 end-page: 163 ident: br0350 article-title: The steiner forest problem revisited publication-title: J. Discret. Algorithms – volume: 31 start-page: 1217 year: 2017 end-page: 1243 ident: br0060 article-title: Metric dimension of bounded tree-length graphs publication-title: SIAM J. Discrete Math. – volume: 79 start-page: 39 year: 2013 end-page: 49 ident: br0370 article-title: Bin packing with fixed number of bins revisited publication-title: J. Comput. Syst. Sci. – volume: 5 year: 2008 ident: br0480 article-title: Approximating rank-width and clique-width quickly publication-title: ACM Trans. Algorithms – volume: 76 start-page: 1181 year: 2016 end-page: 1202 ident: br0220 article-title: On the computational complexity of vertex integrity and component order connectivity publication-title: Algorithmica – volume: 114 start-page: 99 year: 2014 end-page: 103 ident: br0010 article-title: Maximum common induced subgraph parameterized by vertex cover publication-title: Inf. Process. Lett. – year: 1999 ident: 10.1016/j.tcs.2022.03.021_br0210 – volume: 5 issue: 1 year: 2008 ident: 10.1016/j.tcs.2022.03.021_br0480 article-title: Approximating rank-width and clique-width quickly publication-title: ACM Trans. Algorithms doi: 10.1145/1435375.1435385 – volume: 209 start-page: 143 issue: 2 year: 2011 ident: 10.1016/j.tcs.2022.03.021_br0260 article-title: On the complexity of some colorful problems parameterized by treewidth publication-title: Inf. Comput. doi: 10.1016/j.ic.2010.11.026 – volume: 79 start-page: 39 issue: 1 year: 2013 ident: 10.1016/j.tcs.2022.03.021_br0370 article-title: Bin packing with fixed number of bins revisited publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2012.04.004 – ident: 10.1016/j.tcs.2022.03.021_br0410 – volume: 1 start-page: 13 year: 1987 ident: 10.1016/j.tcs.2022.03.021_br0050 article-title: Vulnerability in graphs — a comparative survey publication-title: J. Comb. Math. Comb. Comput. – volume: vol. 5917 start-page: 122 year: 2009 ident: 10.1016/j.tcs.2022.03.021_br0250 article-title: What makes equitable connected partition easy – volume: 33 start-page: 125 issue: 2 year: 2000 ident: 10.1016/j.tcs.2022.03.021_br0180 article-title: Linear time solvable optimization problems on graphs of bounded clique-width publication-title: Theory Comput. Syst. doi: 10.1007/s002249910009 – volume: 411 start-page: 3736 issue: 40–42 year: 2010 ident: 10.1016/j.tcs.2022.03.021_br0150 article-title: Improved upper bounds for vertex cover publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.06.026 – volume: 51 start-page: 326 issue: 3 year: 2008 ident: 10.1016/j.tcs.2022.03.021_br0360 article-title: Width parameters beyond tree-width and their applications publication-title: Comput. J. doi: 10.1093/comjnl/bxm052 – volume: 148 start-page: 27 issue: 1 year: 2005 ident: 10.1016/j.tcs.2022.03.021_br0090 article-title: Balanced vertex-orderings of graphs publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2004.12.001 – volume: vol. 5018 start-page: 78 year: 2008 ident: 10.1016/j.tcs.2022.03.021_br0200 article-title: Capacitated domination and covering: a parameterized perspective – volume: 7 start-page: 505 issue: 4 year: 1986 ident: 10.1016/j.tcs.2022.03.021_br0450 article-title: The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete publication-title: SIAM J. Algebraic Discrete Methods doi: 10.1137/0607057 – volume: 12 start-page: 308 issue: 2 year: 1991 ident: 10.1016/j.tcs.2022.03.021_br0020 article-title: Easy problems for tree-decomposable graphs publication-title: J. Algorithms doi: 10.1016/0196-6774(91)90006-K – start-page: 607 year: 2017 ident: 10.1016/j.tcs.2022.03.021_br0230 article-title: Solving integer linear programs with a small number of global variables and constraints – volume: vol. 12273 start-page: 162 year: 2020 ident: 10.1016/j.tcs.2022.03.021_br0440 article-title: Imbalance parameterized by twin cover revisited – volume: 307 start-page: 567 issue: 3 year: 2003 ident: 10.1016/j.tcs.2022.03.021_br0460 article-title: The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(03)00238-X – volume: 26 start-page: 257 year: 1992 ident: 10.1016/j.tcs.2022.03.021_br0170 article-title: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues publication-title: RAIRO Theor. Inform. Appl. doi: 10.1051/ita/1992260302571 – volume: 80 start-page: 3597 issue: 12 year: 2018 ident: 10.1016/j.tcs.2022.03.021_br0240 article-title: Parameterized complexity of length-bounded cuts and multicuts publication-title: Algorithmica doi: 10.1007/s00453-018-0408-7 – start-page: 1777 year: 2020 ident: 10.1016/j.tcs.2022.03.021_br0110 article-title: Hedonic seat arrangement problems (extended abstract) – volume: 114 start-page: 99 issue: 3 year: 2014 ident: 10.1016/j.tcs.2022.03.021_br0010 article-title: Maximum common induced subgraph parameterized by vertex cover publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2013.11.007 – volume: vol. 117 year: 2018 ident: 10.1016/j.tcs.2022.03.021_br0070 article-title: New results on directed edge dominating set – volume: 12 start-page: 415 year: 1987 ident: 10.1016/j.tcs.2022.03.021_br0380 article-title: Minkowski's convex body theorem and integer programming publication-title: Math. Oper. Res. doi: 10.1287/moor.12.3.415 – volume: 12 issue: 2 year: 2011 ident: 10.1016/j.tcs.2022.03.021_br0510 article-title: Monadic second order logic on graphs with local cardinality constraints publication-title: ACM Trans. Comput. Log. doi: 10.1145/1877714.1877718 – volume: vol. 13 start-page: 179 year: 2010 ident: 10.1016/j.tcs.2022.03.021_br0500 article-title: Not so easy problems for tree decomposable graphs – volume: 31 start-page: 1217 issue: 2 year: 2017 ident: 10.1016/j.tcs.2022.03.021_br0060 article-title: Metric dimension of bounded tree-length graphs publication-title: SIAM J. Discrete Math. doi: 10.1137/16M1057383 – volume: 231 start-page: 78 year: 2017 ident: 10.1016/j.tcs.2022.03.021_br0140 article-title: The graph motif problem parameterized by the structure of the input graph publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2016.11.016 – volume: 8 start-page: 538 year: 1983 ident: 10.1016/j.tcs.2022.03.021_br0400 article-title: Integer programming with a fixed number of variables publication-title: Math. Oper. Res. doi: 10.1287/moor.8.4.538 – volume: 251 start-page: 91 year: 2016 ident: 10.1016/j.tcs.2022.03.021_br0430 article-title: The parameterised complexity of list problems on graphs of bounded treewidth publication-title: Inf. Comput. doi: 10.1016/j.ic.2016.08.001 – volume: vol. 5369 start-page: 294 year: 2008 ident: 10.1016/j.tcs.2022.03.021_br0270 article-title: Graph layout problems parameterized by vertex cover – volume: 113 start-page: 714 issue: 19–21 year: 2013 ident: 10.1016/j.tcs.2022.03.021_br0420 article-title: Imbalance is fixed parameter tractable publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2013.06.010 – volume: 76 start-page: 1181 issue: 4 year: 2016 ident: 10.1016/j.tcs.2022.03.021_br0220 article-title: On the computational complexity of vertex integrity and component order connectivity publication-title: Algorithmica doi: 10.1007/s00453-016-0127-x – volume: vol. 173 year: 2020 ident: 10.1016/j.tcs.2022.03.021_br0080 article-title: Grundy distinguishes treewidth from pathwidth – volume: vol. 148 year: 2019 ident: 10.1016/j.tcs.2022.03.021_br0130 article-title: Metric dimension parameterized by treewidth – volume: vol. 180 year: 2020 ident: 10.1016/j.tcs.2022.03.021_br0390 article-title: Parameterized complexity of geodetic set – year: 2020 ident: 10.1016/j.tcs.2022.03.021_br0330 article-title: On structural parameterizations of the bounded-degree vertex deletion problem publication-title: Algorithmica – year: 2015 ident: 10.1016/j.tcs.2022.03.021_br0190 – volume: vol. 7112 start-page: 259 year: 2011 ident: 10.1016/j.tcs.2022.03.021_br0310 article-title: Twin-cover: beyond vertex cover in parameterized algorithmics – volume: 2 start-page: 387 issue: 4 year: 1981 ident: 10.1016/j.tcs.2022.03.021_br0040 article-title: The bandwidth of caterpillars with hairs of length 1 and 2 publication-title: SIAM J. Algebraic Discrete Methods doi: 10.1137/0602041 – volume: 7 start-page: 49 year: 1987 ident: 10.1016/j.tcs.2022.03.021_br0290 article-title: An application of simultaneous diophantine approximation in combinatorial optimization publication-title: Combinatorica doi: 10.1007/BF02579200 – volume: vol. 317 start-page: 105 year: 1988 ident: 10.1016/j.tcs.2022.03.021_br0100 article-title: Dynamic programming on graphs with bounded treewidth – volume: 34 start-page: 825 issue: 4 year: 2005 ident: 10.1016/j.tcs.2022.03.021_br0160 article-title: On the relationship between clique-width and treewidth publication-title: SIAM J. Comput. doi: 10.1137/S0097539701385351 – volume: 412 start-page: 2513 issue: 23 year: 2011 ident: 10.1016/j.tcs.2022.03.021_br0280 article-title: Parameterized complexity of coloring problems: treewidth versus vertex cover publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.10.043 – start-page: 448 year: 1983 ident: 10.1016/j.tcs.2022.03.021_br0300 article-title: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems – ident: 10.1016/j.tcs.2022.03.021_br0320 – year: 1979 ident: 10.1016/j.tcs.2022.03.021_br0340 – volume: 8 start-page: 154 issue: 2 year: 2010 ident: 10.1016/j.tcs.2022.03.021_br0350 article-title: The steiner forest problem revisited publication-title: J. Discret. Algorithms doi: 10.1016/j.jda.2009.05.002 – volume: 159 start-page: 498 issue: 7 year: 2011 ident: 10.1016/j.tcs.2022.03.021_br0030 article-title: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2010.11.003 – year: 2012 ident: 10.1016/j.tcs.2022.03.021_br0470 article-title: Sparsity: Graphs, Structures, and Algorithms doi: 10.1007/978-3-642-27875-4 – volume: 82 start-page: 3566 issue: 12 year: 2020 ident: 10.1016/j.tcs.2022.03.021_br0120 article-title: Subgraph isomorphism on graph classes that exclude a substructure publication-title: Algorithmica doi: 10.1007/s00453-020-00737-z – volume: vol. 8572 start-page: 931 year: 2014 ident: 10.1016/j.tcs.2022.03.021_br0490 article-title: A faster parameterized algorithm for treedepth |
| SSID | ssj0000576 |
| Score | 2.5400836 |
| Snippet | For problems intractable on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 60 |
| SubjectTerms | Treedepth Vertex cover number Vertex integrity |
| Title | Exploring the gap between treedepth and vertex cover through vertex integrity |
| URI | https://dx.doi.org/10.1016/j.tcs.2022.03.021 |
| Volume | 918 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB5KvejBR1Wsj7IHT0JsNtkkzbEUS1XaixZ6W_YVrUgMGsGTv93ZZFMV1IPHXWYhTGZnvmW-mQE4ZfEgkplSnsJg6DGDV0oyGXoG1xHTJk1FxbaYxZM5u1pEixaMmloYS6t0vr_26ZW3djt9p81-sVz2b2xSD6MpAogKtyxsBTtLrJWfv3_SPBCP1PlKmwFA6SazWXG8SmU7dgdB1ec0oD_Hpi_xZrwNmw4okmH9LTvQMnkHtpohDMTdyQ5sTFeNV192Ybri1BHcJXeiII6JRWz6WZuivCci18SOYTZvRFkGJ3HDeprNuoUEwvM9mI8vbkcTz01M8FSQJqUnM0Q0vorFQOOzS4WCZQHVgZEqohk-ghnGIl9iRGI0SRAqUZWir858E2sU1jLch3b-lJsDIBGjUieG2eJUJmgqQpmxMJYyNgpRgeiC3-iKK9dO3E61eOQNb-yBo3q5VS_3Q47q7cLZ6khR99L4S5g1P4B_MwiOvv73Y4f_O3YE63ZlaQFBegzt8vnVnCDaKGWvMqcerA0vryezD3Sx1GA |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED6VdgAGHgVEeXpgQoqah5M0Y1VRpfSx0ErdLNtxoAiFCILEz-ecOAUkYGCM45Oii333Wff5O4ArGvR8kUppSUyGFlW4pQQVnqXw2aeJiiJesi1mQbygt0t_2YBBfRdG0ypN7K9iehmtzUjXeLObr1bdO13Uw2yKAKLELcsNaGl1Kr8Jrf5oHM8-A7IfViVLXQRAg7q4WdK8CqlFu123lDp1nZ_T05eUM9yDHYMVSb_6nH1oqKwNu3UfBmK2ZRu2p2vt1dcDmK5pdQRHyT3PiSFjEV2BTlRePBCeJUR3YlbvRGoSJzH9eurBSkUCEfohLIY380FsmaYJlnSjsLBEiqDGlgHvJXjykh6nqeskrhLSd1I8B1NMR7bApESdMES05MgIw3VqqyDByYnwjqCZPWfqGIhPHZGEiur7qZQ7EfdESr1AiEBJBAa8A3btKyaNorhubPHEaurYI0P3Mu1eZnsM3duB67VJXslp_DWZ1j-AfVsTDMP972Yn_zO7hM14Pp2wyWg2PoUt_UazBNzoDJrFy5s6R_BRiAuzuD4AywTXEQ |
| 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=Exploring+the+gap+between+treedepth+and+vertex+cover+through+vertex+integrity&rft.jtitle=Theoretical+computer+science&rft.au=Gima%2C+Tatsuya&rft.au=Hanaka%2C+Tesshu&rft.au=Kiyomi%2C+Masashi&rft.au=Kobayashi%2C+Yasuaki&rft.date=2022-05-29&rft.issn=0304-3975&rft.volume=918&rft.spage=60&rft.epage=76&rft_id=info:doi/10.1016%2Fj.tcs.2022.03.021&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2022_03_021 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |