Exact exponential algorithms to find tropical connected sets of minimum size
Tropical Connected Set is strongly related to the Graph Motif problem which deals with vertex-colored graphs. Graph Motif has various applications in biology and metabolic networks, and has widely been studied in the last twenty years. The input of the Tropical Connected Set problem is a vertex-colo...
Uloženo v:
| Vydáno v: | Theoretical computer science Ročník 676; s. 33 - 41 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
09.05.2017
Elsevier |
| Témata: | |
| ISSN: | 0304-3975, 1879-2294 |
| 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 | Tropical Connected Set is strongly related to the Graph Motif problem which deals with vertex-colored graphs. Graph Motif has various applications in biology and metabolic networks, and has widely been studied in the last twenty years.
The input of the Tropical Connected Set problem is a vertex-colored graph (G,c), where G=(V,E) is a graph and c is a vertex coloring assigning to each vertex of G a color. The task is to find a connected subset S⊆V of minimum size such that each color of G appears in S. This problem is known to be NP-complete, even when restricted to trees of height at most three. We study exact exponential algorithms to solve Tropical Connected Set. We present an O⁎(1.5359n) time algorithm for general graphs and an O⁎(1.2721n) time algorithm for trees. We also show that Tropical Connected Set on trees has no sub-exponential algorithm unless the Exponential Time Hypothesis fails. |
|---|---|
| AbstractList | Tropical Connected Set is strongly related to the Graph Motif problem which deals with vertex-colored graphs. Graph Motif has various applications in biology and metabolic networks, and has widely been studied in the last twenty years.
The input of the Tropical Connected Set problem is a vertex-colored graph (G,c), where G=(V,E) is a graph and c is a vertex coloring assigning to each vertex of G a color. The task is to find a connected subset S⊆V of minimum size such that each color of G appears in S. This problem is known to be NP-complete, even when restricted to trees of height at most three. We study exact exponential algorithms to solve Tropical Connected Set. We present an O⁎(1.5359n) time algorithm for general graphs and an O⁎(1.2721n) time algorithm for trees. We also show that Tropical Connected Set on trees has no sub-exponential algorithm unless the Exponential Time Hypothesis fails. |
| Author | Letourneur, Romain Liedloff, Mathieu Chapelle, Mathieu Cochefert, Manfred Kratsch, Dieter |
| Author_xml | – sequence: 1 givenname: Mathieu surname: Chapelle fullname: Chapelle, Mathieu email: Mathieu.ch@gmail.com organization: Université Libre de Bruxelles, CP 212, 1050 Bruxelles, Belgium – sequence: 2 givenname: Manfred surname: Cochefert fullname: Cochefert, Manfred email: manfred.cochefert@univ-lorraine.fr organization: Université de Lorraine, LITA, 57045 Metz cedex 01, France – sequence: 3 givenname: Dieter surname: Kratsch fullname: Kratsch, Dieter email: dieter.kratsch@univ-lorraine.fr organization: Université de Lorraine, LITA, 57045 Metz cedex 01, France – sequence: 4 givenname: Romain surname: Letourneur fullname: Letourneur, Romain email: romain.letourneur@univ-orleans.fr organization: Université d'Orléans, INSA Centre Val de Loire, LIFO, 45067 Orléans, France – sequence: 5 givenname: Mathieu surname: Liedloff fullname: Liedloff, Mathieu email: mathieu.liedloff@univ-orleans.fr organization: Université d'Orléans, INSA Centre Val de Loire, LIFO, 45067 Orléans, France |
| BackLink | https://hal.science/hal-01971120$$DView record in HAL |
| BookMark | eNp9kM9LwzAUx4NMcFP_AG-5emjNj7Zp8TTGdELBi55Dmr64jLYZSRzTv96MiUff5cH7_oD3WaDZ5CZA6I6SnBJaPezyqEPOCBU54Tkh_ALNaS2ajLGmmKE54aTIeCPKK7QIYUfSlKKao3Z9VDpiOO5T3xStGrAaPpy3cTsGHB02dupx9G5vddK0mybQEXocIAbsDB7tZMfPEQf7DTfo0qghwO3vvkbvT-u31SZrX59fVss206zmMWNcKOBlI4TpTV2TznRVJ6pOadKVJaOqM6UGDU3NADrSJLmqlShM0RSVYopfo_tz71YNcu_tqPyXdMrKzbKVpxuhjaCUkQNNXnr2au9C8GD-ApTIEzq5kwmdPKGThMuELmUezxlITxwseBm0hUlDb336XvbO_pP-AfLDeY8 |
| Cites_doi | 10.1109/TCBB.2006.55 10.1016/j.tcs.2012.08.023 10.1007/s00453-012-9630-x 10.1137/S0895480192229273 10.1016/j.jcss.2010.07.003 10.1006/jcss.2000.1727 10.1016/j.ipl.2012.08.008 10.1007/s00224-007-9069-7 10.1007/s00453-010-9404-2 10.1016/j.jcss.2007.10.003 10.1007/s00453-015-9981-1 10.1016/j.jda.2011.03.006 10.1109/TCBB.2011.19 10.1089/cmb.2009.0170 10.1016/j.jda.2010.09.002 10.1007/s00453-011-9600-8 10.1089/cmb.2006.13.133 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier B.V. Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2017 Elsevier B.V. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 1XC |
| DOI | 10.1016/j.tcs.2017.03.003 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 41 |
| ExternalDocumentID | oai:HAL:hal-01971120v1 10_1016_j_tcs_2017_03_003 S0304397517301883 |
| 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 ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD 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 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD 1XC XJT |
| ID | FETCH-LOGICAL-c283t-237ae35977fdf880bfb6b76bac0b5521abf5cece982eeb09fb668a74f4946a2a3 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000401399800003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Tue Oct 14 20:03:53 EDT 2025 Sat Nov 29 05:15:26 EST 2025 Fri Feb 23 02:30:23 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Exact exponential algorithms Graphs Algorithms Colored graphs |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c283t-237ae35977fdf880bfb6b76bac0b5521abf5cece982eeb09fb668a74f4946a2a3 |
| ORCID | 0000-0003-2518-606X |
| PageCount | 9 |
| ParticipantIDs | hal_primary_oai_HAL_hal_01971120v1 crossref_primary_10_1016_j_tcs_2017_03_003 elsevier_sciencedirect_doi_10_1016_j_tcs_2017_03_003 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-05-09 |
| PublicationDateYYYYMMDD | 2017-05-09 |
| PublicationDate_xml | – month: 05 year: 2017 text: 2017-05-09 day: 09 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2017 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Bar-Yehuda, Feldman, Rawitz (br0040) 2008; 43 Nederlof (br0230) 2013; 65 Moran, Snir (br0220) 2008; 74 Cochefert (br0090) 2014 Bodlaender, Fellows, Langston, Ragan, Rosamond, Weyer (br0070) 2011; 61 Abu-Khzam, Mouawad, Liedloff (br0010) 2011; 9 Lacroix, Fernandes, Sagot (br0200) 2006; 3 Angles d'Auriac, Cohen, El Maftouhi, Harutyunyan, Legay, Manoussakis (br0030) 2016; 17 Diestel (br0100) 2012; vol. 173 Bruckner, Hüffner, Karp, Shamir, Sharan (br0080) 2010; 17 Fomin, Kratsch, Woeginger (br0160) 2004; vol. 3353 Björklund, Kaski, Kowalik (br0060) 2016; 74 Fomin, Kratsch (br0150) 2011 Dondi, Fertin, Vialette (br0110) 2011; 9 Impagliazzo, Paturi (br0180) 2001; 62 Koutis (br0190) 2012; 22 Dondi, Fertin, Vialette (br0120) 2013; 483 Fellows, Fertin, Hermelin, Vialette (br0130) 2011; 77 Fellows, Fertin, Hermelin, Vialette (br0140) 2011; 77 Guillemot, Sikora (br0170) 2013; 65 Scott, Ideker, Karp, Sharan (br0240) 2006; 13 Ambalath, Balasundaram, Rao, Koppula, Misra, Philip, Ramanujan (br0020) 2008; vol. 6478 Betzler, Van Bevern, Fellows, Komusiewicz, Niedermeier (br0050) 2011; 8 McMorris, Warnow, Wimer (br0210) 1994; 7 Abu-Khzam (10.1016/j.tcs.2017.03.003_br0010) 2011; 9 Lacroix (10.1016/j.tcs.2017.03.003_br0200) 2006; 3 Björklund (10.1016/j.tcs.2017.03.003_br0060) 2016; 74 Betzler (10.1016/j.tcs.2017.03.003_br0050) 2011; 8 Cochefert (10.1016/j.tcs.2017.03.003_br0090) 2014 McMorris (10.1016/j.tcs.2017.03.003_br0210) 1994; 7 Guillemot (10.1016/j.tcs.2017.03.003_br0170) 2013; 65 Scott (10.1016/j.tcs.2017.03.003_br0240) 2006; 13 Impagliazzo (10.1016/j.tcs.2017.03.003_br0180) 2001; 62 Dondi (10.1016/j.tcs.2017.03.003_br0120) 2013; 483 Bar-Yehuda (10.1016/j.tcs.2017.03.003_br0040) 2008; 43 Fellows (10.1016/j.tcs.2017.03.003_br0140) 2011; 77 Fomin (10.1016/j.tcs.2017.03.003_br0150) 2011 Ambalath (10.1016/j.tcs.2017.03.003_br0020) 2008; vol. 6478 Diestel (10.1016/j.tcs.2017.03.003_br0100) 2012; vol. 173 Dondi (10.1016/j.tcs.2017.03.003_br0110) 2011; 9 Nederlof (10.1016/j.tcs.2017.03.003_br0230) 2013; 65 Koutis (10.1016/j.tcs.2017.03.003_br0190) 2012; 22 Bruckner (10.1016/j.tcs.2017.03.003_br0080) 2010; 17 Angles d'Auriac (10.1016/j.tcs.2017.03.003_br0030) 2016; 17 Bodlaender (10.1016/j.tcs.2017.03.003_br0070) 2011; 61 Fomin (10.1016/j.tcs.2017.03.003_br0160) 2004; vol. 3353 Moran (10.1016/j.tcs.2017.03.003_br0220) 2008; 74 Fellows (10.1016/j.tcs.2017.03.003_br0130) 2011; 77 |
| References_xml | – volume: 9 start-page: 82 year: 2011 end-page: 99 ident: br0110 article-title: Complexity issues in vertex-colored graph pattern matching publication-title: J. Discrete Algorithms – volume: vol. 3353 start-page: 245 year: 2004 end-page: 256 ident: br0160 article-title: Exact (exponential) algorithms for the Dominating Set problem publication-title: Proceedings of WG 2004 – volume: 8 start-page: 1296 year: 2011 end-page: 1308 ident: br0050 article-title: Parameterized algorithmics for finding connected motifs in biological networks publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. – volume: 74 start-page: 850 year: 2008 end-page: 969 ident: br0220 article-title: Convex recolorings of strings and trees: definitions, hardness results and algorithms publication-title: J. Comput. System Sci. – volume: 17 start-page: 327 year: 2016 end-page: 348 ident: br0030 article-title: Connected tropical subgraphs in vertex-colored graphs publication-title: DIMACS Ser. Discrete Math. Theoret. Comput. Sci. – volume: 77 start-page: 799 year: 2011 end-page: 811 ident: br0140 article-title: Upper and lower bounds for finding connected motifs in vertex-colored graphs publication-title: J. Comput. System Sci. – volume: 17 start-page: 237 year: 2010 end-page: 252 ident: br0080 article-title: Topology-free querying of protein interaction networks publication-title: J. Comput. Biol. – volume: 77 start-page: 799 year: 2011 end-page: 811 ident: br0130 article-title: Upper and lower bounds for finding connected motifs in vertex-colored graphs publication-title: J. Comput. System Sci. – volume: 483 start-page: 10 year: 2013 end-page: 21 ident: br0120 article-title: Finding approximate and constrained motifs in graphs publication-title: Theoret. Comput. Sci. – volume: 65 start-page: 828 year: 2013 end-page: 844 ident: br0170 article-title: Finding and counting vertex-colored subtrees publication-title: Algorithmica – volume: 13 start-page: 133 year: 2006 end-page: 144 ident: br0240 article-title: Efficient algorithms for detecting signaling pathways in protein interaction networks publication-title: J. Comput. Biol. – volume: 74 start-page: 947 year: 2016 end-page: 967 ident: br0060 article-title: Constrained multilinear detection and generalized graph motifs publication-title: Algorithmica – volume: 61 start-page: 362 year: 2011 end-page: 388 ident: br0070 article-title: Quadratic kernelization for convex recoloring of trees publication-title: Algorithmica – year: 2014 ident: br0090 article-title: Algorithmes exacts et exponentiels pour les problemes NP-difficiles sur les graphes et hypergraphes – year: 2011 ident: br0150 article-title: Exact Exponential Algorithms – volume: 65 start-page: 868 year: 2013 end-page: 884 ident: br0230 article-title: Fast polynomial-space algorithms using inclusion–exclusion publication-title: Algorithmica – volume: vol. 173 year: 2012 ident: br0100 article-title: Graph Theory publication-title: Grad. Texts in Math. – volume: 7 start-page: 296 year: 1994 end-page: 306 ident: br0210 article-title: Triangulating vertex-colored graphs publication-title: SIAM J. Discrete Math. – volume: vol. 6478 start-page: 14 year: 2008 end-page: 25 ident: br0020 article-title: On the kernelization complexity of colorful motifs publication-title: Proceedings of IPEC 2010 – volume: 22 start-page: 889 year: 2012 end-page: 892 ident: br0190 article-title: Constrained multilinear detection for faster functional motif discovery publication-title: Inform. Process. Lett. – volume: 3 start-page: 360 year: 2006 end-page: 368 ident: br0200 article-title: Motif search in graphs: application to metabolic networks publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. – volume: 9 start-page: 252 year: 2011 end-page: 262 ident: br0010 article-title: An exact algorithm for connected red–blue dominating set publication-title: J. Discrete Algorithms – volume: 43 start-page: 3 year: 2008 end-page: 18 ident: br0040 article-title: Improved approximation algorithm for convex recoloring of trees publication-title: Theory Comput. Syst. – volume: 62 start-page: 367 year: 2001 end-page: 375 ident: br0180 article-title: On the complexity of k-SAT publication-title: J. Comput. System Sci. – volume: vol. 173 year: 2012 ident: 10.1016/j.tcs.2017.03.003_br0100 article-title: Graph Theory – volume: 3 start-page: 360 issue: 4 year: 2006 ident: 10.1016/j.tcs.2017.03.003_br0200 article-title: Motif search in graphs: application to metabolic networks publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2006.55 – volume: vol. 6478 start-page: 14 year: 2008 ident: 10.1016/j.tcs.2017.03.003_br0020 article-title: On the kernelization complexity of colorful motifs – volume: 483 start-page: 10 year: 2013 ident: 10.1016/j.tcs.2017.03.003_br0120 article-title: Finding approximate and constrained motifs in graphs publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2012.08.023 – volume: 65 start-page: 868 year: 2013 ident: 10.1016/j.tcs.2017.03.003_br0230 article-title: Fast polynomial-space algorithms using inclusion–exclusion publication-title: Algorithmica doi: 10.1007/s00453-012-9630-x – volume: 7 start-page: 296 year: 1994 ident: 10.1016/j.tcs.2017.03.003_br0210 article-title: Triangulating vertex-colored graphs publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480192229273 – volume: 77 start-page: 799 issue: 4 year: 2011 ident: 10.1016/j.tcs.2017.03.003_br0140 article-title: Upper and lower bounds for finding connected motifs in vertex-colored graphs publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2010.07.003 – year: 2011 ident: 10.1016/j.tcs.2017.03.003_br0150 – volume: 62 start-page: 367 year: 2001 ident: 10.1016/j.tcs.2017.03.003_br0180 article-title: On the complexity of k-SAT publication-title: J. Comput. System Sci. doi: 10.1006/jcss.2000.1727 – volume: 22 start-page: 889 year: 2012 ident: 10.1016/j.tcs.2017.03.003_br0190 article-title: Constrained multilinear detection for faster functional motif discovery publication-title: Inform. Process. Lett. doi: 10.1016/j.ipl.2012.08.008 – volume: 43 start-page: 3 issue: 1 year: 2008 ident: 10.1016/j.tcs.2017.03.003_br0040 article-title: Improved approximation algorithm for convex recoloring of trees publication-title: Theory Comput. Syst. doi: 10.1007/s00224-007-9069-7 – volume: 61 start-page: 362 issue: 2 year: 2011 ident: 10.1016/j.tcs.2017.03.003_br0070 article-title: Quadratic kernelization for convex recoloring of trees publication-title: Algorithmica doi: 10.1007/s00453-010-9404-2 – year: 2014 ident: 10.1016/j.tcs.2017.03.003_br0090 – volume: 74 start-page: 850 issue: 5 year: 2008 ident: 10.1016/j.tcs.2017.03.003_br0220 article-title: Convex recolorings of strings and trees: definitions, hardness results and algorithms publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2007.10.003 – volume: vol. 3353 start-page: 245 year: 2004 ident: 10.1016/j.tcs.2017.03.003_br0160 article-title: Exact (exponential) algorithms for the Dominating Set problem – volume: 77 start-page: 799 issue: 4 year: 2011 ident: 10.1016/j.tcs.2017.03.003_br0130 article-title: Upper and lower bounds for finding connected motifs in vertex-colored graphs publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2010.07.003 – volume: 74 start-page: 947 issue: 2 year: 2016 ident: 10.1016/j.tcs.2017.03.003_br0060 article-title: Constrained multilinear detection and generalized graph motifs publication-title: Algorithmica doi: 10.1007/s00453-015-9981-1 – volume: 9 start-page: 252 issue: 3 year: 2011 ident: 10.1016/j.tcs.2017.03.003_br0010 article-title: An exact algorithm for connected red–blue dominating set publication-title: J. Discrete Algorithms doi: 10.1016/j.jda.2011.03.006 – volume: 8 start-page: 1296 issue: 5 year: 2011 ident: 10.1016/j.tcs.2017.03.003_br0050 article-title: Parameterized algorithmics for finding connected motifs in biological networks publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2011.19 – volume: 17 start-page: 237 issue: 3 year: 2010 ident: 10.1016/j.tcs.2017.03.003_br0080 article-title: Topology-free querying of protein interaction networks publication-title: J. Comput. Biol. doi: 10.1089/cmb.2009.0170 – volume: 9 start-page: 82 issue: 1 year: 2011 ident: 10.1016/j.tcs.2017.03.003_br0110 article-title: Complexity issues in vertex-colored graph pattern matching publication-title: J. Discrete Algorithms doi: 10.1016/j.jda.2010.09.002 – volume: 65 start-page: 828 issue: 4 year: 2013 ident: 10.1016/j.tcs.2017.03.003_br0170 article-title: Finding and counting vertex-colored subtrees publication-title: Algorithmica doi: 10.1007/s00453-011-9600-8 – volume: 17 start-page: 327 issue: 3 year: 2016 ident: 10.1016/j.tcs.2017.03.003_br0030 article-title: Connected tropical subgraphs in vertex-colored graphs publication-title: DIMACS Ser. Discrete Math. Theoret. Comput. Sci. – volume: 13 start-page: 133 year: 2006 ident: 10.1016/j.tcs.2017.03.003_br0240 article-title: Efficient algorithms for detecting signaling pathways in protein interaction networks publication-title: J. Comput. Biol. doi: 10.1089/cmb.2006.13.133 |
| SSID | ssj0000576 |
| Score | 2.1831837 |
| Snippet | Tropical Connected Set is strongly related to the Graph Motif problem which deals with vertex-colored graphs. Graph Motif has various applications in biology... |
| SourceID | hal crossref elsevier |
| SourceType | Open Access Repository Index Database Publisher |
| StartPage | 33 |
| SubjectTerms | Algorithms Colored graphs Computer Science Data Structures and Algorithms Exact exponential algorithms Graphs |
| Title | Exact exponential algorithms to find tropical connected sets of minimum size |
| URI | https://dx.doi.org/10.1016/j.tcs.2017.03.003 https://hal.science/hal-01971120 |
| Volume | 676 |
| WOSCitedRecordID | wos000401399800003&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: ScienceDirect Freedom Collection - Elsevier customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELbKLgc48FhALC9ZiBNVVmleTo4V21UXSrUSReotsl2HdtUmVZtWFb-Kn8hMbCdZEGg5cLEqu41Sz-eZsT3zDSHvBPMl5yF3JGfKCUTiOVzMpCPVzE1ij7s8llWxCTYex9NpctXp_LC5MPsly_P4cEjW_1XU0AfCxtTZfxB3_VDogM8gdGhB7NDeSvCDA6Y9qsO6yDESCLkAlt-KzaKcryo2B7yl7pabYm24QUDRSnQ7t0qHdSDZyGq36m4X32-ECU1aKY_S1ILoGgPaChLA2xx92o1xjWpXD2FprqzOEMozWyMUtT3AcKtrUp0v2gHDI1VWh647EwW-4oYo3JxTgO3DqMBGG9oEmpZ-8_FSJtGFU86U1r8xSxzP03WPrYKOWFvFat4MY6w1adZvZkCfSFyflRIZ2XtM89j6jc2z9_zD_pf06vwiHV2OP90cbcUpDvsjaOd86YA_zMBBdfew3z72WJiAHj3uXw6mHxvrHzJ9P27-nL1Jr2IKf3mfP_lCd-b2VL_yciaPyAOzPaF9DavHpKPyE_LQlv6gxhKckPufa7rf7RMyqjBHW5ijDeZoWVDEHLWYozXmKGKOFhk1mKOIuafk68Vg8mHomDIdjgTftHQ8n3HlI49hNsvAHIhMRIJFgktXhOAdcpGFUkkFS18p4SYwHMWcBVmQBBH3uP-MHOXwes8J5b0MXeJZNAth5xrGIlDMy1zF0J7znjwl7-2EpWvNxpLaMMXrFGY3xdlNXR8pb09JYKc0NatBu4kpwORvP3sL018_HunXAQAp9jXif3GbL70k95qF8IoclZudek3uyn252G7eGOD8BI7Ho2w |
| 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=Exact+exponential+algorithms+to+find+tropical+connected+sets+of+minimum+size&rft.jtitle=Theoretical+computer+science&rft.au=Chapelle%2C+Mathieu&rft.au=Cochefert%2C+Manfred&rft.au=Kratsch%2C+Dieter&rft.au=Letourneur%2C+Romain&rft.date=2017-05-09&rft.pub=Elsevier&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=676&rft.spage=33&rft.epage=41&rft_id=info:doi/10.1016%2Fj.tcs.2017.03.003&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-01971120v1 |
| 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 |