Enumeration of irredundant forests
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees. If the literature proposes solutions to enumerate singletons...
Uložené v:
| Vydané v: | Theoretical computer science Ročník 922; s. 312 - 334 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
24.06.2022
Elsevier |
| Predmet: | |
| ISSN: | 0304-3975, 1879-2294 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees. If the literature proposes solutions to enumerate singletons of trees, we study in this article a more general problem, the enumeration of sets of trees – forests. Specifically, we mainly study irredundant forests, i.e., where no tree is a subtree of another. By compressing each such forest into a Directed Acyclic Graph (DAG), we develop a reverse search like method to enumerate DAGs compressing irredundant forests. Remarkably, we prove that these DAGs are in bijection with the row-Fishburn matrices, a well-studied class of combinatorial objects. In a second step, we derive our irredundant forest enumeration to provide algorithms for tackling related problems: (i) enumeration of forests in their classical sense (where redundancy is allowed); (ii) the enumeration of “subforests” of a forest, and (iii) the frequent “subforest” mining problem. All the methods presented in this article enumerate each item uniquely, up to isomorphism. |
|---|---|
| AbstractList | Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees. If the literature proposes solutions to enumerate singletons of trees, we study in this article a more general problem, the enumeration of sets of trees -- forests. Specifically, we mainly study irredundant forests, i.e., where no tree is a subtree of another. By compressing each such forest into a Directed Acyclic Graph (DAG), we develop a reverse search like method to enumerate DAGs compressing irredundant forests. Remarkably, we prove that these DAGs are in bijection with the row-Fishburn matrices, a well-studied class of combinatorial objects. In a second step, we derive our irredundant forest enumeration to provide algorithms for tackling related problems: (i) enumeration of forests in their classical sense (where redundancy is allowed); (ii) the enumeration of "subforests" of a forest, and (iii) the frequent "subforest" mining problem. All the methods presented in this article enumerate each item uniquely, up to isomorphism. |
| Author | Ingels, Florian Azaïs, Romain |
| Author_xml | – sequence: 1 givenname: Florian surname: Ingels fullname: Ingels, Florian email: florian.ingels@inria.fr – sequence: 2 givenname: Romain surname: Azaïs fullname: Azaïs, Romain email: romain.azais@inria.fr |
| BackLink | https://hal.science/hal-02511901$$DView record in HAL |
| BookMark | eNp9kE1Lw0AQhhepYFv9Ad6KNw-Jsx_ZTfBUSrVCwIuel81mFre0iexuC_57EysePHQuA8P7vDDPjEy6vkNCbinkFKh82ObJxpwBYzmIHDi_IFNaqipjrBITMgUOIuOVKq7ILMYtDFMoOSV36-6wx2CS77tF7xY-BGwPXWu6tHB9wJjiNbl0Zhfx5nfPyfvT-m21yerX55fVss4sVyJlJVONA9o46hwgp5RWYBh3vHSykRSlaBhYJqFgpWWmULaUJTCUjcLCCsfn5P7U-2F2-jP4vQlfujdeb5a1Hm_AirGUHsWQpaesDX2MAd0fQEGPQvRWD0L0KESD0IOQgVH_GOvTz-MpGL87Sz6eSBzeP3oMOlqPncXWB7RJt70_Q38Dub164g |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2023_114366 crossref_primary_10_1016_j_ic_2025_105353 crossref_primary_10_1016_j_jocs_2025_102583 |
| Cites_doi | 10.1016/0020-0190(88)90065-8 10.1016/j.ejc.2014.04.003 10.1016/0166-218X(95)00026-N 10.1016/S0166-218X(00)00339-5 10.1109/TCBB.2009.29 10.1016/j.tcs.2019.04.017 10.1145/368996.369025 10.1016/S0020-0190(02)00240-5 10.1145/127719.122728 10.1007/s10618-006-0059-1 10.1016/j.jcta.2011.11.010 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier B.V. Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2022 Elsevier B.V. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 1XC VOOES |
| DOI | 10.1016/j.tcs.2022.04.033 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 334 |
| ExternalDocumentID | oai:HAL:hal-02511901v4 10_1016_j_tcs_2022_04_033 S0304397522002584 |
| 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 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AEXQZ AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FGOYB G-2 HZ~ R2- SEW SSZ TAE WUQ ZY4 ~HD 1XC VOOES |
| ID | FETCH-LOGICAL-c374t-827bf01bf1ff0e311190a23f38f6b61e64b20c260528c2a57c86802e6b7e5c4f3 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000850360300025&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 28 06:34:24 EDT 2025 Tue Nov 18 20:45:15 EST 2025 Sat Nov 29 07:21:07 EST 2025 Fri Feb 23 02:40:46 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Directed acyclic graph Forest Enumeration Reverse search Unordered trees Unordered Trees Directed Acyclic Graph Reverse Search |
| 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-c374t-827bf01bf1ff0e311190a23f38f6b61e64b20c260528c2a57c86802e6b7e5c4f3 |
| ORCID | 0000-0002-5234-1822 |
| OpenAccessLink | https://hal.science/hal-02511901 |
| PageCount | 23 |
| ParticipantIDs | hal_primary_oai_HAL_hal_02511901v4 crossref_primary_10_1016_j_tcs_2022_04_033 crossref_citationtrail_10_1016_j_tcs_2022_04_033 elsevier_sciencedirect_doi_10_1016_j_tcs_2022_04_033 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-06-24 |
| PublicationDateYYYYMMDD | 2022-06-24 |
| PublicationDate_xml | – month: 06 year: 2022 text: 2022-06-24 day: 24 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Nakano (br0190) 2002; 84 Jelínek (br0140) 2012; 119 Asai, Arimura, Uno, Nakano (br0010) 2003 Avis, Fukuda (br0020) 1996; 65 Kahn (br0170) 1962; 5 Vishwanathan, Smola (br0240) 2002; vol. 14 Bringmann, Li, Rhoades (br0070) 2014; 41 Nakano, Uno (br0200) 2003 Nowozin (br0210) 2009 Yamazaki, Saitoh, Kiyomi, Uehara (br0250) 2020; 806 Yan, Han (br0260) 2002 Azaïs, Durand, Godin (br0040) January 2019 Hart, DeFanti (br0120) July 1991; 25 Han, Cheng, Xin, Yan (br0110) 2007; 15 Godin, Ferraro (br0100) 2010; 7 Johnson, Yannakakis, Papadimitriou (br0150) 1988; 27 Collins, Duffy (br0080) 2002 Azaïs, Cerutti, Gemmerlé, Ingels (br0030) 2019; 4 Land, Doig (br0180) 2010 Sutherland (br0230) 1963 Schwikowski, Speckenmeyer (br0220) 2002; 117 Bender, Williamson (br0060) 2010 Flajolet, Sedgewick (br0090) 2009 Charles H. Jones, Generalized hockey stick identities and n-dimensional blockwalking, 1994. Azaïs, Ingels (br0050) 2020; 21 Hwang, Jin (br0130) 2019 Hwang (10.1016/j.tcs.2022.04.033_br0130) Land (10.1016/j.tcs.2022.04.033_br0180) 2010 Kahn (10.1016/j.tcs.2022.04.033_br0170) 1962; 5 Jelínek (10.1016/j.tcs.2022.04.033_br0140) 2012; 119 Flajolet (10.1016/j.tcs.2022.04.033_br0090) 2009 Godin (10.1016/j.tcs.2022.04.033_br0100) 2010; 7 Yamazaki (10.1016/j.tcs.2022.04.033_br0250) 2020; 806 Bringmann (10.1016/j.tcs.2022.04.033_br0070) 2014; 41 Yan (10.1016/j.tcs.2022.04.033_br0260) 2002 Vishwanathan (10.1016/j.tcs.2022.04.033_br0240) 2002; vol. 14 Nakano (10.1016/j.tcs.2022.04.033_br0190) 2002; 84 Bender (10.1016/j.tcs.2022.04.033_br0060) 2010 Collins (10.1016/j.tcs.2022.04.033_br0080) 2002 Avis (10.1016/j.tcs.2022.04.033_br0020) 1996; 65 Azaïs (10.1016/j.tcs.2022.04.033_br0040) 2019 Hart (10.1016/j.tcs.2022.04.033_br0120) 1991; 25 Schwikowski (10.1016/j.tcs.2022.04.033_br0220) 2002; 117 10.1016/j.tcs.2022.04.033_br0160 Nakano (10.1016/j.tcs.2022.04.033_br0200) 2003 Asai (10.1016/j.tcs.2022.04.033_br0010) 2003 Han (10.1016/j.tcs.2022.04.033_br0110) 2007; 15 Azaïs (10.1016/j.tcs.2022.04.033_br0050) 2020; 21 Johnson (10.1016/j.tcs.2022.04.033_br0150) 1988; 27 Sutherland (10.1016/j.tcs.2022.04.033_br0230) 1963 Nowozin (10.1016/j.tcs.2022.04.033_br0210) 2009 Azaïs (10.1016/j.tcs.2022.04.033_br0030) 2019; 4 |
| References_xml | – volume: 4 year: 2019 ident: br0030 article-title: treex: a Python package for manipulating rooted trees publication-title: J. Open Sour. Softw. – volume: 25 start-page: 91 year: July 1991 end-page: 100 ident: br0120 article-title: Efficient antialiased rendering of 3-d linear fractals publication-title: SIGGRAPH Comput. Graph. – volume: 41 start-page: 183 year: 2014 end-page: 196 ident: br0070 article-title: Asymptotics for the number of row-Fishburn matrices publication-title: Eur. J. Comb. – start-page: 105 year: 2010 end-page: 132 ident: br0180 article-title: An automatic method for solving discrete programming problems publication-title: 50 Years of Integer Programming 1958-2008 – year: 2010 ident: br0060 article-title: Lists, Decisions and Graphs – volume: 5 start-page: 558 year: 1962 end-page: 562 ident: br0170 article-title: Topological sorting of large networks publication-title: Commun. ACM – volume: 65 start-page: 21 year: 1996 end-page: 46 ident: br0020 article-title: Reverse search for enumeration publication-title: Discrete Appl. Math. – year: 2009 ident: br0210 article-title: Learning with structured data: applications to computer vision – volume: 21 start-page: 1 year: 2020 end-page: 36 ident: br0050 article-title: The weight function in the subtree kernel is decisive publication-title: J. Mach. Learn. Res. – volume: 806 start-page: 310 year: 2020 end-page: 322 ident: br0250 article-title: Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs publication-title: Theor. Comput. Sci. – volume: 7 start-page: 688 year: 2010 end-page: 703 ident: br0100 article-title: Quantifying the degree of self-nestedness of trees: application to the structural analysis of plants publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. – volume: 119 start-page: 599 year: 2012 end-page: 614 ident: br0140 article-title: Counting general and self-dual interval orders publication-title: J. Comb. Theory, Ser. A – start-page: 1 year: January 2019 end-page: 24 ident: br0040 article-title: Approximation of trees by self-nested trees publication-title: ALENEX 2019 - Algorithm Engineering and Experiments – volume: 15 start-page: 55 year: 2007 end-page: 86 ident: br0110 article-title: Frequent pattern mining: current status and future directions publication-title: Data Min. Knowl. Discov. – volume: vol. 14 year: 2002 ident: br0240 article-title: Fast kernels on strings and trees publication-title: Advances on Neural Information Processing Systems – volume: 27 start-page: 119 year: 1988 end-page: 123 ident: br0150 article-title: On generating all maximal independent sets publication-title: Inf. Process. Lett. – start-page: 625 year: 2002 end-page: 632 ident: br0080 article-title: Convolution kernels for natural language publication-title: Advances in Neural Information Processing Systems – volume: 117 start-page: 253 year: 2002 end-page: 265 ident: br0220 article-title: On enumerating all minimal solutions of feedback problems publication-title: Discrete Appl. Math. – start-page: 721 year: 2002 end-page: 724 ident: br0260 article-title: gspan: graph-based substructure pattern mining publication-title: 2002 IEEE International Conference on Data Mining, 2002, Proceedings – volume: 84 start-page: 167 year: 2002 end-page: 172 ident: br0190 article-title: Efficient generation of plane trees publication-title: Inf. Process. Lett. – start-page: 329 year: 1963 end-page: 346 ident: br0230 article-title: Sketchpad: a man-machine graphical communication system publication-title: Proceedings of the May 21–23, 1963, Spring Joint Computer Conference, AFIPS '63 (Spring) – reference: Charles H. Jones, Generalized hockey stick identities and n-dimensional blockwalking, 1994. – year: 2003 ident: br0200 article-title: Efficient generation of rooted trees – year: 2009 ident: br0090 article-title: Analytic Combinatorics – year: 2019 ident: br0130 article-title: Asymptotics and statistics on Fishburn matrices and their generalizations – start-page: 47 year: 2003 end-page: 61 ident: br0010 article-title: Discovering frequent substructures in large unordered trees publication-title: International Conference on Discovery Science – volume: 27 start-page: 119 issue: 3 year: 1988 ident: 10.1016/j.tcs.2022.04.033_br0150 article-title: On generating all maximal independent sets publication-title: Inf. Process. Lett. doi: 10.1016/0020-0190(88)90065-8 – ident: 10.1016/j.tcs.2022.04.033_br0130 – ident: 10.1016/j.tcs.2022.04.033_br0160 – volume: 41 start-page: 183 year: 2014 ident: 10.1016/j.tcs.2022.04.033_br0070 article-title: Asymptotics for the number of row-Fishburn matrices publication-title: Eur. J. Comb. doi: 10.1016/j.ejc.2014.04.003 – volume: vol. 14 year: 2002 ident: 10.1016/j.tcs.2022.04.033_br0240 article-title: Fast kernels on strings and trees – year: 2009 ident: 10.1016/j.tcs.2022.04.033_br0090 – volume: 65 start-page: 21 issue: 1–3 year: 1996 ident: 10.1016/j.tcs.2022.04.033_br0020 article-title: Reverse search for enumeration publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(95)00026-N – volume: 21 start-page: 1 year: 2020 ident: 10.1016/j.tcs.2022.04.033_br0050 article-title: The weight function in the subtree kernel is decisive publication-title: J. Mach. Learn. Res. – start-page: 105 year: 2010 ident: 10.1016/j.tcs.2022.04.033_br0180 article-title: An automatic method for solving discrete programming problems – start-page: 625 year: 2002 ident: 10.1016/j.tcs.2022.04.033_br0080 article-title: Convolution kernels for natural language – volume: 117 start-page: 253 issue: 1–3 year: 2002 ident: 10.1016/j.tcs.2022.04.033_br0220 article-title: On enumerating all minimal solutions of feedback problems publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(00)00339-5 – start-page: 329 year: 1963 ident: 10.1016/j.tcs.2022.04.033_br0230 article-title: Sketchpad: a man-machine graphical communication system – volume: 7 start-page: 688 issue: 4 year: 2010 ident: 10.1016/j.tcs.2022.04.033_br0100 article-title: Quantifying the degree of self-nestedness of trees: application to the structural analysis of plants publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2009.29 – start-page: 721 year: 2002 ident: 10.1016/j.tcs.2022.04.033_br0260 article-title: gspan: graph-based substructure pattern mining – volume: 806 start-page: 310 year: 2020 ident: 10.1016/j.tcs.2022.04.033_br0250 article-title: Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2019.04.017 – volume: 5 start-page: 558 issue: 11 year: 1962 ident: 10.1016/j.tcs.2022.04.033_br0170 article-title: Topological sorting of large networks publication-title: Commun. ACM doi: 10.1145/368996.369025 – volume: 84 start-page: 167 issue: 3 year: 2002 ident: 10.1016/j.tcs.2022.04.033_br0190 article-title: Efficient generation of plane trees publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(02)00240-5 – volume: 4 year: 2019 ident: 10.1016/j.tcs.2022.04.033_br0030 article-title: treex: a Python package for manipulating rooted trees publication-title: J. Open Sour. Softw. – volume: 25 start-page: 91 issue: 4 year: 1991 ident: 10.1016/j.tcs.2022.04.033_br0120 article-title: Efficient antialiased rendering of 3-d linear fractals publication-title: SIGGRAPH Comput. Graph. doi: 10.1145/127719.122728 – start-page: 47 year: 2003 ident: 10.1016/j.tcs.2022.04.033_br0010 article-title: Discovering frequent substructures in large unordered trees – year: 2003 ident: 10.1016/j.tcs.2022.04.033_br0200 – volume: 15 start-page: 55 issue: 1 year: 2007 ident: 10.1016/j.tcs.2022.04.033_br0110 article-title: Frequent pattern mining: current status and future directions publication-title: Data Min. Knowl. Discov. doi: 10.1007/s10618-006-0059-1 – year: 2009 ident: 10.1016/j.tcs.2022.04.033_br0210 – start-page: 1 year: 2019 ident: 10.1016/j.tcs.2022.04.033_br0040 article-title: Approximation of trees by self-nested trees – year: 2010 ident: 10.1016/j.tcs.2022.04.033_br0060 – volume: 119 start-page: 599 issue: 3 year: 2012 ident: 10.1016/j.tcs.2022.04.033_br0140 article-title: Counting general and self-dual interval orders publication-title: J. Comb. Theory, Ser. A doi: 10.1016/j.jcta.2011.11.010 |
| SSID | ssj0000576 |
| Score | 2.3829434 |
| Snippet | Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining... |
| SourceID | hal crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 312 |
| SubjectTerms | Combinatorics Computer Science Data Structures and Algorithms Directed acyclic graph Discrete Mathematics Enumeration Forest Mathematics Reverse search Unordered trees |
| Title | Enumeration of irredundant forests |
| URI | https://dx.doi.org/10.1016/j.tcs.2022.04.033 https://hal.science/hal-02511901 |
| Volume | 922 |
| WOSCitedRecordID | wos000850360300025&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: 1879-2294 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211209 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3LT9swGLfG4wAH2BiI16YIcQIFOXbix7FCrdg0EIdO6s1yXFuAthS1BSH-ej7HTlpAoHHYJYqs5lPq35fv5e-B0KFwThvJTUqZBgelJDyVJNNpyRkbWi6GLBvWwyb4xYUYDORlnCg4qccJ8KoSDw_y9r9CDWsAti-d_QDcLVFYgHsAHa4AO1z_Cfhu5UsqW0vwejy2vlJM-yZMIz-JYzJvkPbnChlNnPBwHNViyzY-8bXGu-fz9Wb81HnU9UF7L4RrRn917OMdwwjggWKWhurlpnzKH5HIMMakEY0y1AxH4UZjwnPQkzQEIV-J4BANuDmZGt8NnZC6k2xodvG83fULNdQmBzZ5ZzcKSChPQuFcAYkFtER4IUF2LXV-dAc_Zxq34OFMOv6F5vS6zuN78R5v2R8LV00kvbYs-p_RWnQJkk6A8gv6ZKsNtN6M20ii9N1Aq-dti93JV3Qwh3MycskczknEeRP97nX7p2dpHHiRGsrzaSoILx3OSpc5hy0FNSSxJtRR4VjJMsvgW8LGe6BEGKILbgQTmFhWcluY3NEttFiNKruNElNQ6zjOTDEkuSGiFNiXQEtBNTeUljsIN9ugTOwG74eS_FFvbv8OOmofuQ2tUN77cd7srYpMG2w0BXzy3mMHgENL3vc-P-v8Un6tdobBer3Pdz_yIntoZcbu-2hxOr6z39CyuZ9eT8bfIyc9AWUIcVQ |
| 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=Enumeration+of+irredundant+forests&rft.jtitle=Theoretical+computer+science&rft.au=Ingels%2C+Florian&rft.au=Aza%C3%AFs%2C+Romain&rft.date=2022-06-24&rft.issn=0304-3975&rft.volume=922&rft.spage=312&rft.epage=334&rft_id=info:doi/10.1016%2Fj.tcs.2022.04.033&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2022_04_033 |
| 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 |