Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes
The problem of deletion of vertices to a hereditary graph class is a well-studied problem in parameterized complexity. Recently, a natural extension of the problem was initiated where we are given a finite set of hereditary graph classes and we determine whether k vertices can be deleted from a give...
Uložené v:
| Vydané v: | Journal of computer and system sciences Ročník 136; s. 280 - 301 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
01.09.2023
|
| Predmet: | |
| ISSN: | 0022-0000, 1090-2724 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The problem of deletion of vertices to a hereditary graph class is a well-studied problem in parameterized complexity. Recently, a natural extension of the problem was initiated where we are given a finite set of hereditary graph classes and we determine whether k vertices can be deleted from a given graph so that the connected components of the resulting graph belong to one of the given hereditary graph classes. The problem is shown to be fixed parameter tractable (FPT) when the deletion problem to each of the given hereditary graph classes is fixed-parameter tractable, and the property of being in any of the graph classes is expressible in the counting monodic second order (CMSO) logic. This paper focuses on pairs of specific graph classes (Π1,Π2) in which we would like the connected components of the resulting graph to belong to, and design simpler and more efficient FPT algorithms. |
|---|---|
| AbstractList | The problem of deletion of vertices to a hereditary graph class is a well-studied problem in parameterized complexity. Recently, a natural extension of the problem was initiated where we are given a finite set of hereditary graph classes and we determine whether k vertices can be deleted from a given graph so that the connected components of the resulting graph belong to one of the given hereditary graph classes. The problem is shown to be fixed parameter tractable (FPT) when the deletion problem to each of the given hereditary graph classes is fixed-parameter tractable, and the property of being in any of the graph classes is expressible in the counting monodic second order (CMSO) logic. This paper focuses on pairs of specific graph classes (Π1,Π2) in which we would like the connected components of the resulting graph to belong to, and design simpler and more efficient FPT algorithms. |
| Author | Majumdar, Diptapriyo Raman, Venkatesh Jacob, Ashwin |
| Author_xml | – sequence: 1 givenname: Ashwin surname: Jacob fullname: Jacob, Ashwin email: ashwinj@bgu.ac.il organization: Ben-Gurion University of the Negev, Beersheva, Israel – sequence: 2 givenname: Diptapriyo orcidid: 0000-0003-2677-4648 surname: Majumdar fullname: Majumdar, Diptapriyo email: diptapriyo@iiitd.ac.in organization: Indraprastha Institute of Information Technology Delhi, New Delhi, India – sequence: 3 givenname: Venkatesh surname: Raman fullname: Raman, Venkatesh email: vraman@imsc.res.in organization: The Institute of Mathematical Sciences, HBNI, Chennai, India |
| BookMark | eNp9kM1KAzEUhYNUsK2-gKu8wIw3d_464Eaq1UJBF3UdMsmdNsO0KUko-PZOqQt10cuBuzh8B86ZsNHe7YmxewGpAFE-dGmnQ0gRMEthEORXbCyghgQrzEdsDICYwHA3bBJCByBEUWZjtnmmnqJ1ex4dD1rFSJ4M33h12HLdqxAo8OWSJ9zuDt4dB2_xseaq3zhv43YXeOs8N79CDsr6wF37N-OWXbeqD3T386fsc_Gynr8lq_fX5fxplegMICbY6Ey3aKqS6qpVjSbUuq7UrDGqBDFDQTWaslCYC2GGUqSQsMC2qcvCFFk2ZXjO1d6F4KmVB293yn9JAfI0lezkaSp5mkrCIMgHaPYP0jaqU6Hole0vo49nlIZSR0teBm1pr8lYTzpK4-wl_BvkDYgZ |
| CitedBy_id | crossref_primary_10_1016_j_jcss_2024_103597 crossref_primary_10_1016_j_ipl_2025_106570 |
| Cites_doi | 10.1137/S0895480196305124 10.1007/s00453-012-9661-3 10.1186/s13015-015-0043-7 10.1145/3014587 10.1145/2629595 10.1137/S0097539793243016 10.1145/3389338 10.1007/s00453-015-0014-x 10.4064/fm-51-1-45-64 10.1016/0020-0190(96)00050-6 10.1016/j.tcs.2010.06.026 10.1016/j.ipl.2013.01.001 10.1145/2566616 10.1007/s00224-022-10076-x 10.1016/j.ipl.2014.05.001 10.1016/0022-0000(80)90060-4 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier Inc. |
| Copyright_xml | – notice: 2023 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jcss.2023.03.004 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2724 |
| EndPage | 301 |
| ExternalDocumentID | 10_1016_j_jcss_2023_03_004 S0022000023000417 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1~. 1~5 29K 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN AAYJJ ABBOA ABEFU ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AETEA AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 D-I DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG5 LG9 LY7 M41 MO0 MVM N9A NCXOZ O-L O9- OAUVE OHT OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSZ T5K TN5 TWZ UPT WH7 WUQ XJT XOL XPP YQT ZCG ZMT ZU3 ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-2bc3cf2d76e97fabce2cc97a8bda601821e92d65a2411d002ea2e252fb965d533 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000990255200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0022-0000 |
| IngestDate | Sat Nov 29 04:16:30 EST 2025 Tue Nov 18 20:55:33 EST 2025 Fri Feb 23 02:39:37 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Interval graphs Bipartite permutation graphs Scattered graph classes Approximation algorithms Fixed-parameter tractability Chordal graphs |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-2bc3cf2d76e97fabce2cc97a8bda601821e92d65a2411d002ea2e252fb965d533 |
| ORCID | 0000-0003-2677-4648 |
| PageCount | 22 |
| ParticipantIDs | crossref_primary_10_1016_j_jcss_2023_03_004 crossref_citationtrail_10_1016_j_jcss_2023_03_004 elsevier_sciencedirect_doi_10_1016_j_jcss_2023_03_004 |
| PublicationCentury | 2000 |
| PublicationDate | September 2023 2023-09-00 |
| PublicationDateYYYYMMDD | 2023-09-01 |
| PublicationDate_xml | – month: 09 year: 2023 text: September 2023 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of computer and system sciences |
| PublicationYear | 2023 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Bożyk, Derbisz, Krawczyk, Novotná, Okrasa (br0040) 2020 Bruckner, Hüffner, Komusiewicz (br0060) 2015; 10 Lewis, Yannakakis (br0250) 1980; 20 Garg, Vazirani, Yannakakis (br0170) 1996; 25 Jacob, Majumdar, Raman (br0200) 2021; vol. 12867 Diestel (br0140) 2012; vol. 173 Jacob, de Kroon, Majumdar, Raman (br0180) 2021 Cygan, Pilipczuk (br0130) 2013; 113 Lekkeikerker, Boland (br0240) 1962; 51 Ganian, Ramanujan, Szeider (br0160) 2017; 13 Brandstadt, Spinrad (br0050) 1999 Kawarabayashi, Sidiropoulos (br0220) 2017 Agrawal, Lokshtanov, Misra, Saurabh, Zehavi (br0010) 2020; 16 Chen, Kanj, Xia (br0110) 2010; 411 Cai (br0070) 1996; 58 Bafna, Berman, Fujito (br0030) 1999; 12 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh (br0120) 2015 Jansen, Lokshtanov, Saurabh (br0210) 2014 Aoike, Gima, Hanaka, Kiyomi, Kobayashi, Kobayashi, Kurita, Otachi (br0020) 2022; 66 Cao, Marx (br0090) 2015; 11 Fomin, Lokshtanov, Misra, Saurabh (br0150) 2012 Jacob, Majumdar, Raman (br0190) 2020 Kociumaka, Pilipczuk (br0230) 2014; 114 Cao, Marx (br0100) 2016; 75 Lokshtanov, Narayanaswamy, Raman, Ramanujan, Saurabh (br0260) 2014; 11 Cao (br0080) 2016 Van't Hof, Villanger (br0270) 2013; 65 Kawarabayashi (10.1016/j.jcss.2023.03.004_br0220) 2017 Bruckner (10.1016/j.jcss.2023.03.004_br0060) 2015; 10 Van't Hof (10.1016/j.jcss.2023.03.004_br0270) 2013; 65 Bożyk (10.1016/j.jcss.2023.03.004_br0040) 2020 Cao (10.1016/j.jcss.2023.03.004_br0100) 2016; 75 Chen (10.1016/j.jcss.2023.03.004_br0110) 2010; 411 Cygan (10.1016/j.jcss.2023.03.004_br0120) 2015 Lewis (10.1016/j.jcss.2023.03.004_br0250) 1980; 20 Cygan (10.1016/j.jcss.2023.03.004_br0130) 2013; 113 Jacob (10.1016/j.jcss.2023.03.004_br0200) 2021; vol. 12867 Ganian (10.1016/j.jcss.2023.03.004_br0160) 2017; 13 Aoike (10.1016/j.jcss.2023.03.004_br0020) 2022; 66 Bafna (10.1016/j.jcss.2023.03.004_br0030) 1999; 12 Lokshtanov (10.1016/j.jcss.2023.03.004_br0260) 2014; 11 Garg (10.1016/j.jcss.2023.03.004_br0170) 1996; 25 Jacob (10.1016/j.jcss.2023.03.004_br0190) 2020 Jansen (10.1016/j.jcss.2023.03.004_br0210) 2014 Cao (10.1016/j.jcss.2023.03.004_br0090) 2015; 11 Cai (10.1016/j.jcss.2023.03.004_br0070) 1996; 58 Jacob (10.1016/j.jcss.2023.03.004_br0180) Lekkeikerker (10.1016/j.jcss.2023.03.004_br0240) 1962; 51 Diestel (10.1016/j.jcss.2023.03.004_br0140) 2012; vol. 173 Fomin (10.1016/j.jcss.2023.03.004_br0150) 2012 Agrawal (10.1016/j.jcss.2023.03.004_br0010) 2020; 16 Brandstadt (10.1016/j.jcss.2023.03.004_br0050) 1999 Kociumaka (10.1016/j.jcss.2023.03.004_br0230) 2014; 114 Cao (10.1016/j.jcss.2023.03.004_br0080) 2016 |
| References_xml | – volume: 13 year: 2017 ident: br0160 article-title: Discovering archipelagos of tractability for constraint satisfaction and counting publication-title: ACM Trans. Algorithms – year: 2015 ident: br0120 article-title: Parameterized Algorithms, vol. 3 – year: 2021 ident: br0180 article-title: Deletion to scattered graph classes i - case of finite number of graph classes – start-page: 1802 year: 2014 end-page: 1811 ident: br0210 article-title: A near-optimal planarization algorithm publication-title: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms – volume: vol. 173 year: 2012 ident: br0140 article-title: Graph Theory publication-title: Graduate Texts in Mathematics – volume: 16 start-page: 1 year: 2020 end-page: 38 ident: br0010 article-title: Polylogarithmic approximation algorithms for weighted-f-deletion problems publication-title: ACM Trans. Algorithms – volume: 11 start-page: 1 year: 2015 end-page: 35 ident: br0090 article-title: Interval deletion is fixed-parameter tractable publication-title: ACM Trans. Algorithms – volume: 20 start-page: 219 year: 1980 end-page: 230 ident: br0250 article-title: The node-deletion problem for hereditary properties is np-complete publication-title: J. Comput. Syst. Sci. – volume: 58 start-page: 171 year: 1996 end-page: 176 ident: br0070 article-title: Fixed-parameter tractability of graph modification problems for hereditary properties publication-title: Inf. Process. Lett. – volume: 12 start-page: 289 year: 1999 end-page: 297 ident: br0030 article-title: A 2-approximation algorithm for the undirected feedback vertex set problem publication-title: SIAM J. Discrete Math. – volume: 75 start-page: 118 year: 2016 end-page: 137 ident: br0100 article-title: Chordal editing is fixed-parameter tractable publication-title: Algorithmica – start-page: 779 year: 2017 end-page: 788 ident: br0220 article-title: Polylogarithmic approximation for minimum planarization (almost) publication-title: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) – volume: 51 start-page: 45 year: 1962 end-page: 64 ident: br0240 article-title: Representation of a finite graph by a set of intervals on the real line publication-title: Fundam. Math. – volume: 114 start-page: 556 year: 2014 end-page: 560 ident: br0230 article-title: Faster deterministic feedback vertex set publication-title: Inf. Process. Lett. – volume: 113 start-page: 179 year: 2013 end-page: 182 ident: br0130 article-title: Split vertex deletion meets vertex cover: new fixed-parameter and exact exponential-time algorithms publication-title: Inf. Process. Lett. – volume: 66 start-page: 502 year: 2022 end-page: 515 ident: br0020 article-title: An improved deterministic parameterized algorithm for cactus vertex deletion publication-title: Theory Comput. Syst. – volume: 411 start-page: 3736 year: 2010 end-page: 3756 ident: br0110 article-title: Improved upper bounds for vertex cover publication-title: Theor. Comput. Sci. – volume: 65 start-page: 845 year: 2013 end-page: 867 ident: br0270 article-title: Proper interval vertex deletion publication-title: Algorithmica – year: 1999 ident: br0050 article-title: Graph Classes: a Survey, vol. 3 – volume: 10 start-page: 1 year: 2015 end-page: 13 ident: br0060 article-title: A graph modification approach for finding core–periphery structures in protein interaction networks publication-title: Algorithms Mol. Biol. – year: 2020 ident: br0190 article-title: Parameterized complexity of deletion to scattered graph classes publication-title: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) – year: 2020 ident: br0040 article-title: Vertex deletion into bipartite permutation graphs publication-title: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) – start-page: 1096 year: 2016 end-page: 1115 ident: br0080 article-title: Linear recognition of almost interval graphs publication-title: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms – volume: 11 start-page: 1 year: 2014 end-page: 31 ident: br0260 article-title: Faster parameterized algorithms using linear programming publication-title: ACM Trans. Algorithms – volume: 25 start-page: 235 year: 1996 end-page: 251 ident: br0170 article-title: Approximate max-flow min-(multi) cut theorems and their applications publication-title: SIAM J. Comput. – volume: vol. 12867 start-page: 314 year: 2021 end-page: 326 ident: br0200 article-title: Faster FPT algorithms for deletion to pairs of graph classes publication-title: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12–15, 2021, Proceedings – start-page: 470 year: 2012 end-page: 479 ident: br0150 article-title: Planar f-deletion: approximation, kernelization and optimal fpt algorithms publication-title: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science – volume: 12 start-page: 289 issue: 3 year: 1999 ident: 10.1016/j.jcss.2023.03.004_br0030 article-title: A 2-approximation algorithm for the undirected feedback vertex set problem publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480196305124 – volume: 65 start-page: 845 issue: 4 year: 2013 ident: 10.1016/j.jcss.2023.03.004_br0270 article-title: Proper interval vertex deletion publication-title: Algorithmica doi: 10.1007/s00453-012-9661-3 – volume: 10 start-page: 1 issue: 1 year: 2015 ident: 10.1016/j.jcss.2023.03.004_br0060 article-title: A graph modification approach for finding core–periphery structures in protein interaction networks publication-title: Algorithms Mol. Biol. doi: 10.1186/s13015-015-0043-7 – volume: 13 issue: 2 year: 2017 ident: 10.1016/j.jcss.2023.03.004_br0160 article-title: Discovering archipelagos of tractability for constraint satisfaction and counting publication-title: ACM Trans. Algorithms doi: 10.1145/3014587 – year: 2020 ident: 10.1016/j.jcss.2023.03.004_br0040 article-title: Vertex deletion into bipartite permutation graphs – volume: 11 start-page: 1 issue: 3 year: 2015 ident: 10.1016/j.jcss.2023.03.004_br0090 article-title: Interval deletion is fixed-parameter tractable publication-title: ACM Trans. Algorithms doi: 10.1145/2629595 – volume: 25 start-page: 235 issue: 2 year: 1996 ident: 10.1016/j.jcss.2023.03.004_br0170 article-title: Approximate max-flow min-(multi) cut theorems and their applications publication-title: SIAM J. Comput. doi: 10.1137/S0097539793243016 – ident: 10.1016/j.jcss.2023.03.004_br0180 – start-page: 470 year: 2012 ident: 10.1016/j.jcss.2023.03.004_br0150 article-title: Planar f-deletion: approximation, kernelization and optimal fpt algorithms – volume: 16 start-page: 1 issue: 4 year: 2020 ident: 10.1016/j.jcss.2023.03.004_br0010 article-title: Polylogarithmic approximation algorithms for weighted-f-deletion problems publication-title: ACM Trans. Algorithms doi: 10.1145/3389338 – volume: 75 start-page: 118 issue: 1 year: 2016 ident: 10.1016/j.jcss.2023.03.004_br0100 article-title: Chordal editing is fixed-parameter tractable publication-title: Algorithmica doi: 10.1007/s00453-015-0014-x – volume: 51 start-page: 45 issue: 1 year: 1962 ident: 10.1016/j.jcss.2023.03.004_br0240 article-title: Representation of a finite graph by a set of intervals on the real line publication-title: Fundam. Math. doi: 10.4064/fm-51-1-45-64 – year: 2015 ident: 10.1016/j.jcss.2023.03.004_br0120 – year: 2020 ident: 10.1016/j.jcss.2023.03.004_br0190 article-title: Parameterized complexity of deletion to scattered graph classes – volume: 58 start-page: 171 issue: 4 year: 1996 ident: 10.1016/j.jcss.2023.03.004_br0070 article-title: Fixed-parameter tractability of graph modification problems for hereditary properties publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(96)00050-6 – volume: 411 start-page: 3736 issue: 40–42 year: 2010 ident: 10.1016/j.jcss.2023.03.004_br0110 article-title: Improved upper bounds for vertex cover publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.06.026 – year: 1999 ident: 10.1016/j.jcss.2023.03.004_br0050 – volume: 113 start-page: 179 issue: 5–6 year: 2013 ident: 10.1016/j.jcss.2023.03.004_br0130 article-title: Split vertex deletion meets vertex cover: new fixed-parameter and exact exponential-time algorithms publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2013.01.001 – start-page: 1096 year: 2016 ident: 10.1016/j.jcss.2023.03.004_br0080 article-title: Linear recognition of almost interval graphs – volume: vol. 12867 start-page: 314 year: 2021 ident: 10.1016/j.jcss.2023.03.004_br0200 article-title: Faster FPT algorithms for deletion to pairs of graph classes – volume: vol. 173 year: 2012 ident: 10.1016/j.jcss.2023.03.004_br0140 article-title: Graph Theory – start-page: 779 year: 2017 ident: 10.1016/j.jcss.2023.03.004_br0220 article-title: Polylogarithmic approximation for minimum planarization (almost) – start-page: 1802 year: 2014 ident: 10.1016/j.jcss.2023.03.004_br0210 article-title: A near-optimal planarization algorithm – volume: 11 start-page: 1 issue: 2 year: 2014 ident: 10.1016/j.jcss.2023.03.004_br0260 article-title: Faster parameterized algorithms using linear programming publication-title: ACM Trans. Algorithms doi: 10.1145/2566616 – volume: 66 start-page: 502 issue: 2 year: 2022 ident: 10.1016/j.jcss.2023.03.004_br0020 article-title: An improved deterministic parameterized algorithm for cactus vertex deletion publication-title: Theory Comput. Syst. doi: 10.1007/s00224-022-10076-x – volume: 114 start-page: 556 issue: 10 year: 2014 ident: 10.1016/j.jcss.2023.03.004_br0230 article-title: Faster deterministic feedback vertex set publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2014.05.001 – volume: 20 start-page: 219 issue: 2 year: 1980 ident: 10.1016/j.jcss.2023.03.004_br0250 article-title: The node-deletion problem for hereditary properties is np-complete publication-title: J. Comput. Syst. Sci. doi: 10.1016/0022-0000(80)90060-4 |
| SSID | ssj0011563 |
| Score | 2.4096093 |
| Snippet | The problem of deletion of vertices to a hereditary graph class is a well-studied problem in parameterized complexity. Recently, a natural extension of the... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 280 |
| SubjectTerms | Approximation algorithms Bipartite permutation graphs Chordal graphs Fixed-parameter tractability Interval graphs Scattered graph classes |
| Title | Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes |
| URI | https://dx.doi.org/10.1016/j.jcss.2023.03.004 |
| Volume | 136 |
| WOSCitedRecordID | wos000990255200001&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: 1090-2724 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011563 issn: 0022-0000 databaseCode: AIEXJ dateStart: 20211208 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELfKxgM88DFAjC_5gbcoKLGTOnms2CaCYNpDmfoWObaztitJlWRl_Cn8t5xjJ035mAAJqYqqtL5Ivl_uzr67nxF6PeaRFIwqN6ZcukGm4FuoMtdnOZVcBYq2Ryecf2Cnp9FsFp-NRt-6XpjNihVFdH0dr_-rquEeKFu3zv6FunuhcAO-g9LhCmqH6x8p_khpPm2dAyidWrT0mRBUtsTUjtCxsqqdJHFc3SBZlRv47eRs6vDVRVktmrnhZ3DkQMhap3x0ULkj4zdRrbCnRLRJCUMT7Vgvuy1WBCvcpoEm9fzLokfnR768-ixNwfcRmDK-rhZfy20iyu7VnqviUgfI8-GGBaF9RZbdRes6aXYKPduuAu08jV8yxtiLPZcw02PdW2u6Y28jb-C6qXnMT17BbFAs3yxFrRnaCTW8tsHWB_aViTp5rbuX9NJMc5GxW2ifsDAGg7k_SY5n7_sUFSx8aUdFrwfYjixTPPjjk34d9QwimekDdM8qC08MdB6ikSoO0P3ueA9srf0BujvgqnyELjpc4abEPa5wiwlsMYGTBLu4wxUGXOEtrjDgCsuBkBZXuMx3ZTxGn06Op2_fufaUDlfAFDUuyQQVOZFsrGKW80woIkTMeJRJDqv9iPgqJnIccogVfQnTpThRJCR5Fo9DCauNJ2ivKAv1FOEwFxD_-1Hue1mQhZz7ma_yPBLMB_EkO0R-N4upsBT2-iSVVdrVKi5TPfOpnvnUg48XHCKnH7M2BC43_jvslJPal8OElilg6YZxz_5x3HN0Z_uKvEB7TXWlXqLbYtMs6uqVhdx3SS6uqw |
| 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=Deletion+to+scattered+graph+classes+II+-+improved+FPT+algorithms+for+deletion+to+pairs+of+graph+classes&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=Jacob%2C+Ashwin&rft.au=Majumdar%2C+Diptapriyo&rft.au=Raman%2C+Venkatesh&rft.date=2023-09-01&rft.pub=Elsevier+Inc&rft.issn=0022-0000&rft.eissn=1090-2724&rft.volume=136&rft.spage=280&rft.epage=301&rft_id=info:doi/10.1016%2Fj.jcss.2023.03.004&rft.externalDocID=S0022000023000417 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-0000&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-0000&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-0000&client=summon |