Parameterised temporal exploration problems
We study the fixed-parameter tractability of the problem of deciding whether a given temporal graph admits a temporal walk that visits all vertices (temporal exploration) or, in some variants, a certain subset of the vertices. In the strict variant, edges must be traversed in strictly increasing tim...
Uloženo v:
| Vydáno v: | Journal of computer and system sciences Ročník 135; s. 73 - 88 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.08.2023
|
| Témata: | |
| ISSN: | 0022-0000, 1090-2724 |
| 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 | We study the fixed-parameter tractability of the problem of deciding whether a given temporal graph admits a temporal walk that visits all vertices (temporal exploration) or, in some variants, a certain subset of the vertices. In the strict variant, edges must be traversed in strictly increasing timesteps; in the non-strict variant, any number of edges can be traversed in each timestep. For both variants, we give FPT algorithms for finding a temporal walk that visits a given set X of vertices, parameterised by |X|, and for finding a temporal walk that visits at least k distinct vertices, parameterised by k. We also show W[2]-hardness for a set version of temporal exploration. For the non-strict variant, we give an FPT algorithm for temporal exploration parameterised by the lifetime, and show that temporal exploration can be solved in polynomial time if the graph in each timestep has at most two connected components. |
|---|---|
| AbstractList | We study the fixed-parameter tractability of the problem of deciding whether a given temporal graph admits a temporal walk that visits all vertices (temporal exploration) or, in some variants, a certain subset of the vertices. In the strict variant, edges must be traversed in strictly increasing timesteps; in the non-strict variant, any number of edges can be traversed in each timestep. For both variants, we give FPT algorithms for finding a temporal walk that visits a given set X of vertices, parameterised by |X|, and for finding a temporal walk that visits at least k distinct vertices, parameterised by k. We also show W[2]-hardness for a set version of temporal exploration. For the non-strict variant, we give an FPT algorithm for temporal exploration parameterised by the lifetime, and show that temporal exploration can be solved in polynomial time if the graph in each timestep has at most two connected components. |
| Author | Spooner, Jakob T. Erlebach, Thomas |
| Author_xml | – sequence: 1 givenname: Thomas surname: Erlebach fullname: Erlebach, Thomas email: thomas.erlebach@durham.ac.uk organization: Department of Computer Science, Durham University, UK – sequence: 2 givenname: Jakob T. surname: Spooner fullname: Spooner, Jakob T. email: jakob.t.spooner@gmail.com organization: School of Computing and Mathematical Sciences, University of Leicester, UK |
| BookMark | eNp9j01LxDAURYOMYGf0D7jqXlrfS6ZpC25k0FEY0IWuQ5q8Qkq_SIrovzdlXHs3727O454t24zTSIzdIuQIKO-7vDMh5By4yAFzAHHBEoQaMl7y_YYlAJxnEHPFtiF0AIiFFAm7e9deD7SQd4FsutAwT173KX3PfSyLm8Z09lPT0xCu2WWr-0A3f3fHPp-fPg4v2ent-Hp4PGWG18WS2RqltaUQhWx5a2wcAKhlU7ZQF1gUptLWCBBoGtlYiExV2lJWptF7I3krdoyf_xo_heCpVbN3g_Y_CkGtuqpTq65adRWgiroRejhDFJd9OfIqGEejIes8mUXZyf2H_wLeBmAO |
| Cites_doi | 10.1080/15427951.2016.1177801 10.1016/j.jcss.2019.02.003 10.14778/2732939.2732945 10.1016/j.jcss.2021.04.001 10.1016/j.ipl.2018.10.016 10.1016/j.jcss.2019.08.002 10.1051/ita/2016022 10.1137/0110015 10.1007/s00453-004-1088-z 10.1007/s00453-021-00831-w 10.1016/j.jcss.2021.01.005 10.1145/210332.210337 10.1007/s00224-017-9796-3 10.1016/j.jcss.2019.07.006 10.1145/321105.321111 10.1080/17445760.2012.668546 10.1007/978-1-4612-0515-9 10.1142/S0129054103001728 10.1006/jcss.2002.1829 10.1016/j.tcs.2016.04.006 |
| ContentType | Journal Article |
| Copyright | 2023 The Author(s) |
| Copyright_xml | – notice: 2023 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.jcss.2023.01.003 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2724 |
| EndPage | 88 |
| ExternalDocumentID | 10_1016_j_jcss_2023_01_003 S0022000023000107 |
| GrantInformation_xml | – fundername: EPSRC grantid: EP/S033483/2; EP/T01461X/1 funderid: https://doi.org/10.13039/501100000266 |
| 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-c295t-d916dd73356f2fcd72401a6b7f095155c8adc3031cb6bd029587d768cba4c62f3 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000965887900001&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 Fri Feb 23 02:36:02 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Temporal graphs Fixed-parameter tractability Parameterised complexity |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c295t-d916dd73356f2fcd72401a6b7f095155c8adc3031cb6bd029587d768cba4c62f3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.jcss.2023.01.003 |
| PageCount | 16 |
| ParticipantIDs | crossref_primary_10_1016_j_jcss_2023_01_003 elsevier_sciencedirect_doi_10_1016_j_jcss_2023_01_003 |
| PublicationCentury | 2000 |
| PublicationDate | August 2023 2023-08-00 |
| PublicationDateYYYYMMDD | 2023-08-01 |
| PublicationDate_xml | – month: 08 year: 2023 text: August 2023 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of computer and system sciences |
| PublicationYear | 2023 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Held, Karp (br0310) 1962; 10 Adamson, Gusev, Malyshev, Zamaraev (br0200) 2022; vol. 221 Robbins (br0320) 1955; 62 Akrida, Mertzios, Spirakis, Zamaraev (br0040) 2020; 107 Akrida, Czyzowicz, Gąsieniec, Kuszner, Spirakis (br0060) 2019; 103 Diestel (br0260) 2000 Mertzios, Molter, Niedermeier, Zamaraev, Zschoche (br0050) 2020; vol. 154 Erlebach, Hoffmann, Kammer (br0150) 2021; 119 Kempe, Kleinberg, Kumar (br0240) 2002; 64 Erlebach, Spooner (br0110) 2020; vol. 12156 Casteigts, Flocchini, Quattrociocchi, Santoro (br0120) 2012; 27 Akrida, Mertzios, Spirakis, Raptopoulos (br0210) 2021; 120 Noon (br0290) 1988 Bui-Xuan, Ferreira, Jarry (br0140) 2003; 14 Brodén, Hammar, Nilsson (br0130) 2004; 39 Michail (br0020) 2016; 12 Bonnet, Paschos, Sikora (br0340) 2016; 50 Bumpus, Meeks (br0230) 2022 Shannon (br0010) 1993 Downey, Fellows (br0270) 1999 Garey, Johnson (br0330) 1979 Michail, Spirakis (br0080) 2016; 634 Ilcinkas, Wade (br0160) 2018; 62 Molter (br0070) 2020 Taghian Alamouti (br0190) 2020 Zschoche, Fluschnik, Molter, Niedermeier (br0250) 2020; 107 Bellman (br0300) 1962; 9 Casteigts, Himmel, Molter, Zschoche (br0220) 2021; 83 Alon, Yuster, Zwick Color-coding (br0090) 1995; 42 Bodlaender, van der Zanden (br0170) 2019; 142 Wu, Cheng, Huang, Ke, Lu, Xu (br0030) 2014; 7 Naor, Schulman, Srinivasan (br0100) 1995 Erlebach, Kammer, Luo, Sajenko, Spooner (br0180) 2019; vol. 132 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh (br0280) 2015 Wu (10.1016/j.jcss.2023.01.003_br0030) 2014; 7 Brodén (10.1016/j.jcss.2023.01.003_br0130) 2004; 39 Casteigts (10.1016/j.jcss.2023.01.003_br0220) 2021; 83 Akrida (10.1016/j.jcss.2023.01.003_br0040) 2020; 107 Zschoche (10.1016/j.jcss.2023.01.003_br0250) 2020; 107 Naor (10.1016/j.jcss.2023.01.003_br0100) 1995 Garey (10.1016/j.jcss.2023.01.003_br0330) 1979 Michail (10.1016/j.jcss.2023.01.003_br0080) 2016; 634 Taghian Alamouti (10.1016/j.jcss.2023.01.003_br0190) 2020 Shannon (10.1016/j.jcss.2023.01.003_br0010) 1993 Diestel (10.1016/j.jcss.2023.01.003_br0260) 2000 Downey (10.1016/j.jcss.2023.01.003_br0270) 1999 Michail (10.1016/j.jcss.2023.01.003_br0020) 2016; 12 Kempe (10.1016/j.jcss.2023.01.003_br0240) 2002; 64 Held (10.1016/j.jcss.2023.01.003_br0310) 1962; 10 Cygan (10.1016/j.jcss.2023.01.003_br0280) 2015 Robbins (10.1016/j.jcss.2023.01.003_br0320) 1955; 62 Ilcinkas (10.1016/j.jcss.2023.01.003_br0160) 2018; 62 Bodlaender (10.1016/j.jcss.2023.01.003_br0170) 2019; 142 Erlebach (10.1016/j.jcss.2023.01.003_br0150) 2021; 119 Erlebach (10.1016/j.jcss.2023.01.003_br0180) 2019; vol. 132 Erlebach (10.1016/j.jcss.2023.01.003_br0110) 2020; vol. 12156 Bui-Xuan (10.1016/j.jcss.2023.01.003_br0140) 2003; 14 Molter (10.1016/j.jcss.2023.01.003_br0070) 2020 Alon (10.1016/j.jcss.2023.01.003_br0090) 1995; 42 Akrida (10.1016/j.jcss.2023.01.003_br0210) 2021; 120 Noon (10.1016/j.jcss.2023.01.003_br0290) 1988 Mertzios (10.1016/j.jcss.2023.01.003_br0050) 2020; vol. 154 Adamson (10.1016/j.jcss.2023.01.003_br0200) 2022; vol. 221 Bellman (10.1016/j.jcss.2023.01.003_br0300) 1962; 9 Casteigts (10.1016/j.jcss.2023.01.003_br0120) 2012; 27 Bumpus (10.1016/j.jcss.2023.01.003_br0230) 2022 Akrida (10.1016/j.jcss.2023.01.003_br0060) 2019; 103 Bonnet (10.1016/j.jcss.2023.01.003_br0340) 2016; 50 |
| References_xml | – volume: 142 start-page: 68 year: 2019 end-page: 71 ident: br0170 article-title: On exploring always-connected temporal graphs of small pathwidth publication-title: Inf. Process. Lett. – volume: 39 start-page: 299 year: 2004 end-page: 319 ident: br0130 article-title: Online and offline algorithms for the time-dependent TSP with time zones publication-title: Algorithmica – volume: 10 start-page: 196 year: 1962 end-page: 210 ident: br0310 article-title: A dynamic programming approach to sequencing problems publication-title: J. Soc. Ind. Appl. Math. – volume: 42 start-page: 844 year: 1995 end-page: 856 ident: br0090 publication-title: J. ACM – volume: 27 start-page: 387 year: 2012 end-page: 408 ident: br0120 article-title: Time-varying graphs and dynamic networks publication-title: Int. J. Parallel Emerg. Distrib. Syst. – year: 1999 ident: br0270 article-title: Parameterized Complexity publication-title: Monographs in Computer Science – volume: 634 start-page: 1 year: 2016 end-page: 23 ident: br0080 article-title: Traveling salesman problems in temporal graphs publication-title: Theor. Comput. Sci. – volume: 107 start-page: 72 year: 2020 end-page: 92 ident: br0250 article-title: The complexity of finding small separators in temporal graphs publication-title: J. Comput. Syst. Sci. – year: 2000 ident: br0260 article-title: Graph Theory – volume: 62 start-page: 26 year: 1955 end-page: 29 ident: br0320 article-title: A remark on Stirling's formula publication-title: Am. Math. Mon. – volume: 64 start-page: 820 year: 2002 end-page: 842 ident: br0240 article-title: Connectivity and inference problems for temporal networks publication-title: J. Comput. Syst. Sci. – volume: 14 start-page: 267 year: 2003 end-page: 285 ident: br0140 article-title: Computing shortest, fastest, and foremost journeys in dynamic networks publication-title: Int. J. Found. Comput. Sci. – volume: 9 start-page: 61 year: 1962 end-page: 63 ident: br0300 article-title: Dynamic programming treatment of the travelling salesman problem publication-title: J. ACM – year: 2020 ident: br0070 article-title: Classic graph problems made temporal - a parameterized complexity analysis – volume: 107 start-page: 108 year: 2020 end-page: 123 ident: br0040 article-title: Temporal vertex cover with a sliding time window publication-title: J. Comput. Syst. Sci. – year: 1988 ident: br0290 article-title: The generalized traveling salesman problem – volume: 12 start-page: 239 year: 2016 end-page: 280 ident: br0020 article-title: An introduction to temporal graphs: an algorithmic perspective publication-title: Internet Math. – year: 2015 ident: br0280 article-title: Parameterized Algorithms – start-page: 681 year: 1993 end-page: 687 ident: br0010 article-title: Presentation of a maze-solving machine publication-title: Claude Elwood Shannon Collected Papers – volume: vol. 221 start-page: 5:1 year: 2022 end-page: 5:10 ident: br0200 article-title: Faster exploration of some temporal graphs publication-title: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) – year: 1979 ident: br0330 article-title: Computers and Intractability. A Guide to the Theory of NP-Completeness – year: 2020 ident: br0190 article-title: Exploring temporal cycles and grids – year: 2022 ident: br0230 article-title: Edge exploration of temporal graphs publication-title: Algorithmica – volume: 103 start-page: 46 year: 2019 end-page: 60 ident: br0060 article-title: Temporal flows in temporal networks publication-title: J. Comput. Syst. Sci. – volume: 62 start-page: 1144 year: 2018 end-page: 1160 ident: br0160 article-title: Exploration of the T-interval-connected dynamic graphs: the case of the ring publication-title: Theory Comput. Syst. – volume: 119 start-page: 1 year: 2021 end-page: 18 ident: br0150 article-title: On temporal graph exploration publication-title: J. Comput. Syst. Sci. – volume: 83 start-page: 2754 year: 2021 end-page: 2802 ident: br0220 article-title: Finding temporal paths under waiting time constraints publication-title: Algorithmica – volume: vol. 154 start-page: 27:1 year: 2020 end-page: 27:14 ident: br0050 article-title: Computing maximum matchings in temporal graphs publication-title: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) – volume: 7 start-page: 721 year: 2014 end-page: 732 ident: br0030 article-title: Path problems in temporal graphs publication-title: Proc. VLDB Endow. – start-page: 182 year: 1995 end-page: 191 ident: br0100 article-title: Splitters and near-optimal derandomization publication-title: IEEE 36th Annual Symposium on Foundations of Computer Science (FOCS 1995) – volume: 120 start-page: 179 year: 2021 end-page: 193 ident: br0210 article-title: The temporal explorer who returns to the base publication-title: J. Comput. Syst. Sci. – volume: 50 start-page: 227 year: 2016 end-page: 240 ident: br0340 article-title: Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems publication-title: RAIRO Theor. Inform. Appl. – volume: vol. 12156 start-page: 129 year: 2020 end-page: 145 ident: br0110 article-title: Non-strict temporal exploration publication-title: 27th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2020) – volume: vol. 132 start-page: 141:1 year: 2019 end-page: 141:14 ident: br0180 article-title: Two moves per time step make a difference publication-title: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) – year: 1979 ident: 10.1016/j.jcss.2023.01.003_br0330 – year: 1988 ident: 10.1016/j.jcss.2023.01.003_br0290 – volume: vol. 154 start-page: 27:1 year: 2020 ident: 10.1016/j.jcss.2023.01.003_br0050 article-title: Computing maximum matchings in temporal graphs – volume: 12 start-page: 239 issue: 4 year: 2016 ident: 10.1016/j.jcss.2023.01.003_br0020 article-title: An introduction to temporal graphs: an algorithmic perspective publication-title: Internet Math. doi: 10.1080/15427951.2016.1177801 – volume: 103 start-page: 46 year: 2019 ident: 10.1016/j.jcss.2023.01.003_br0060 article-title: Temporal flows in temporal networks publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2019.02.003 – volume: 7 start-page: 721 issue: 9 year: 2014 ident: 10.1016/j.jcss.2023.01.003_br0030 article-title: Path problems in temporal graphs publication-title: Proc. VLDB Endow. doi: 10.14778/2732939.2732945 – volume: 120 start-page: 179 year: 2021 ident: 10.1016/j.jcss.2023.01.003_br0210 article-title: The temporal explorer who returns to the base publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2021.04.001 – volume: 142 start-page: 68 year: 2019 ident: 10.1016/j.jcss.2023.01.003_br0170 article-title: On exploring always-connected temporal graphs of small pathwidth publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2018.10.016 – volume: 107 start-page: 108 year: 2020 ident: 10.1016/j.jcss.2023.01.003_br0040 article-title: Temporal vertex cover with a sliding time window publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2019.08.002 – year: 2022 ident: 10.1016/j.jcss.2023.01.003_br0230 article-title: Edge exploration of temporal graphs publication-title: Algorithmica – volume: 50 start-page: 227 issue: 3 year: 2016 ident: 10.1016/j.jcss.2023.01.003_br0340 article-title: Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems publication-title: RAIRO Theor. Inform. Appl. doi: 10.1051/ita/2016022 – volume: vol. 132 start-page: 141:1 year: 2019 ident: 10.1016/j.jcss.2023.01.003_br0180 article-title: Two moves per time step make a difference – volume: 10 start-page: 196 issue: 1 year: 1962 ident: 10.1016/j.jcss.2023.01.003_br0310 article-title: A dynamic programming approach to sequencing problems publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0110015 – volume: 39 start-page: 299 issue: 4 year: 2004 ident: 10.1016/j.jcss.2023.01.003_br0130 article-title: Online and offline algorithms for the time-dependent TSP with time zones publication-title: Algorithmica doi: 10.1007/s00453-004-1088-z – volume: 83 start-page: 2754 issue: 9 year: 2021 ident: 10.1016/j.jcss.2023.01.003_br0220 article-title: Finding temporal paths under waiting time constraints publication-title: Algorithmica doi: 10.1007/s00453-021-00831-w – start-page: 681 year: 1993 ident: 10.1016/j.jcss.2023.01.003_br0010 article-title: Presentation of a maze-solving machine – volume: 119 start-page: 1 year: 2021 ident: 10.1016/j.jcss.2023.01.003_br0150 article-title: On temporal graph exploration publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2021.01.005 – volume: 42 start-page: 844 issue: 4 year: 1995 ident: 10.1016/j.jcss.2023.01.003_br0090 publication-title: J. ACM doi: 10.1145/210332.210337 – year: 2020 ident: 10.1016/j.jcss.2023.01.003_br0070 – volume: 62 start-page: 1144 issue: 5 year: 2018 ident: 10.1016/j.jcss.2023.01.003_br0160 article-title: Exploration of the T-interval-connected dynamic graphs: the case of the ring publication-title: Theory Comput. Syst. doi: 10.1007/s00224-017-9796-3 – volume: 107 start-page: 72 year: 2020 ident: 10.1016/j.jcss.2023.01.003_br0250 article-title: The complexity of finding small separators in temporal graphs publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2019.07.006 – volume: 9 start-page: 61 issue: 1 year: 1962 ident: 10.1016/j.jcss.2023.01.003_br0300 article-title: Dynamic programming treatment of the travelling salesman problem publication-title: J. ACM doi: 10.1145/321105.321111 – volume: 27 start-page: 387 issue: 5 year: 2012 ident: 10.1016/j.jcss.2023.01.003_br0120 article-title: Time-varying graphs and dynamic networks publication-title: Int. J. Parallel Emerg. Distrib. Syst. doi: 10.1080/17445760.2012.668546 – volume: 62 start-page: 26 issue: 1 year: 1955 ident: 10.1016/j.jcss.2023.01.003_br0320 article-title: A remark on Stirling's formula publication-title: Am. Math. Mon. – year: 1999 ident: 10.1016/j.jcss.2023.01.003_br0270 article-title: Parameterized Complexity doi: 10.1007/978-1-4612-0515-9 – year: 2000 ident: 10.1016/j.jcss.2023.01.003_br0260 – year: 2020 ident: 10.1016/j.jcss.2023.01.003_br0190 – year: 2015 ident: 10.1016/j.jcss.2023.01.003_br0280 – volume: vol. 12156 start-page: 129 year: 2020 ident: 10.1016/j.jcss.2023.01.003_br0110 article-title: Non-strict temporal exploration – volume: 14 start-page: 267 issue: 2 year: 2003 ident: 10.1016/j.jcss.2023.01.003_br0140 article-title: Computing shortest, fastest, and foremost journeys in dynamic networks publication-title: Int. J. Found. Comput. Sci. doi: 10.1142/S0129054103001728 – start-page: 182 year: 1995 ident: 10.1016/j.jcss.2023.01.003_br0100 article-title: Splitters and near-optimal derandomization – volume: vol. 221 start-page: 5:1 year: 2022 ident: 10.1016/j.jcss.2023.01.003_br0200 article-title: Faster exploration of some temporal graphs – volume: 64 start-page: 820 issue: 4 year: 2002 ident: 10.1016/j.jcss.2023.01.003_br0240 article-title: Connectivity and inference problems for temporal networks publication-title: J. Comput. Syst. Sci. doi: 10.1006/jcss.2002.1829 – volume: 634 start-page: 1 year: 2016 ident: 10.1016/j.jcss.2023.01.003_br0080 article-title: Traveling salesman problems in temporal graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.04.006 |
| SSID | ssj0011563 |
| Score | 2.4225724 |
| Snippet | We study the fixed-parameter tractability of the problem of deciding whether a given temporal graph admits a temporal walk that visits all vertices (temporal... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 73 |
| SubjectTerms | Fixed-parameter tractability Parameterised complexity Temporal graphs |
| Title | Parameterised temporal exploration problems |
| URI | https://dx.doi.org/10.1016/j.jcss.2023.01.003 |
| Volume | 135 |
| WOSCitedRecordID | wos000965887900001&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: 20211207 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8NAEF609aAH3-KbHLyFSLqbZJNjEUVFxEOF3sI-smAtbWmq-POdze6mqaio4CWUwKaw3zDzze7MNwidEcwJVRySHCJFELEkC5gIi4CqQnIwKIV5hfQdvb9P-_3swc67L6txAnQ0St_essm_Qg3vAGzdOvsLuOuPwgv4DaDDE2CH54-Af2C63qqSYAYyaaWnhlrKf-jgtlNkyi-YqbCTHqqLBSP17NtIOWfg02HBmZkj1Sgyqu7hx2PbRXPLnsfc7503jxYwqQvb7HmX63lZKMms6v91mDMRxLjNMAsDTE03dO1XSdzwjGZgiYux6afe2xwkDM4HotRK6phUiqohmcequoJQXzLrLiOdQum8li6jNqZxBo6t3b257N_WV0mQoBInGa8X2M4pU-T38Z8-ZycNxtHbROsWEK9rIN5CS8VoG224MRye9crbaK2hKbmD_AX8PYe_18Dfc_jvosery97FdWAnYgQCZ_EskEDmpaSExInCSkjY8bDDEk6VZspxLFImBZCSjuAJlyGsSamEhFJwFokEK7KHWiOwgX3k8SgF1FRB4wKIDBYZj0RIhSoYizjO1AHy3U7kEyN8kruKwEGu9y3X-5aHHS0ve4Bit1m5NUhDyXLA9pt1h39cd4RW5wZ7jFqz6UtxglbE6-ypnJ5aE3gHreFoxQ |
| 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=Parameterised+temporal+exploration+problems&rft.jtitle=Journal+of+computer+and+system+sciences&rft.au=Erlebach%2C+Thomas&rft.au=Spooner%2C+Jakob+T.&rft.date=2023-08-01&rft.pub=Elsevier+Inc&rft.issn=0022-0000&rft.eissn=1090-2724&rft.volume=135&rft.spage=73&rft.epage=88&rft_id=info:doi/10.1016%2Fj.jcss.2023.01.003&rft.externalDocID=S0022000023000107 |
| 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 |