Combinatorial Generation Algorithms for Directed Lattice Paths
Graphs are a powerful tool for solving various mathematical problems. One such task is the representation of discrete structures. Combinatorial generation methods make it possible to obtain algorithms that can create discrete structures with specified properties. This article is devoted to issues re...
Uložené v:
| Vydané v: | Mathematics (Basel) Ročník 12; číslo 8; s. 1207 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Basel
MDPI AG
01.04.2024
|
| Predmet: | |
| ISSN: | 2227-7390, 2227-7390 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Graphs are a powerful tool for solving various mathematical problems. One such task is the representation of discrete structures. Combinatorial generation methods make it possible to obtain algorithms that can create discrete structures with specified properties. This article is devoted to issues related to the construction of such combinatorial generation algorithms for a wide class of directed lattice paths. The main method used is based on the representation of a given combinatorial set in the form of an AND/OR tree structure. To apply this method, it is necessary to have an expression for the cardinality function of a combinatorial set that satisfies certain requirements. As the main result, we have found recurrence relations for enumerating simple directed lattice paths that satisfy the requirements of the applied method and have constructed the corresponding AND/OR tree structure. Applying the constructed AND/OR tree structure, we have developed new algorithms for ranking and unranking simple directed lattice paths. Additionally, the obtained results were generalized to the case of directed lattice paths. |
|---|---|
| AbstractList | Graphs are a powerful tool for solving various mathematical problems. One such task is the representation of discrete structures. Combinatorial generation methods make it possible to obtain algorithms that can create discrete structures with specified properties. This article is devoted to issues related to the construction of such combinatorial generation algorithms for a wide class of directed lattice paths. The main method used is based on the representation of a given combinatorial set in the form of an AND/OR tree structure. To apply this method, it is necessary to have an expression for the cardinality function of a combinatorial set that satisfies certain requirements. As the main result, we have found recurrence relations for enumerating simple directed lattice paths that satisfy the requirements of the applied method and have constructed the corresponding AND/OR tree structure. Applying the constructed AND/OR tree structure, we have developed new algorithms for ranking and unranking simple directed lattice paths. Additionally, the obtained results were generalized to the case of directed lattice paths. |
| Audience | Academic |
| Author | Merinov, Arsen Kruchinin, Dmitry Shablya, Yuriy |
| Author_xml | – sequence: 1 givenname: Yuriy orcidid: 0000-0002-9695-7493 surname: Shablya fullname: Shablya, Yuriy – sequence: 2 givenname: Arsen surname: Merinov fullname: Merinov, Arsen – sequence: 3 givenname: Dmitry orcidid: 0000-0003-3412-432X surname: Kruchinin fullname: Kruchinin, Dmitry |
| BookMark | eNpNkU1LAzEQhoMoWGtv_oAFr7bma7PJRShVa6GgBz2HaT7alO6mZtOD_95oRZohZHgz8-Qlc4XOu9g5hG4InjCm8H0LeUMolmU3Z2hAKW3GTbk4P8kv0ajvt7gsRZjkaoAeZrFdhQ5yTAF21dx1LkEOsaumu3XR8qbtKx9T9RiSM9nZagk5B-Oqt_Jef40uPOx6N_o7h-jj-el99jJevs4Xs-lybJhgeSxFQ7GzzHIKwgHh3FrpsSFeEEuMXLHGekMlpp5TLoRviMJSeGh4rRgDNkSLI9dG2Op9Ci2kLx0h6F8hprWGVGztnF4R4mkBrjxnXHCpAGrhiOWYGaOsLazbI2uf4ufB9Vlv4yF1xb5mmAslOCGyVE2OVWso0ND5mBOYEta1wZSv96Ho00axuuayxqXh7thgUuz75Py_TYL1z4T06YTYNzmeg3Q |
| Cites_doi | 10.1016/S0012-365X(98)00371-9 10.3390/a16060266 10.1201/b18255 10.1007/978-3-030-11102-1 10.3390/a8020190 10.1016/j.disc.2018.12.005 10.1016/S0378-3758(01)00180-X 10.3390/sym12040600 10.3390/math8060962 10.1090/tran/8199 10.37236/4781 10.1137/S0097539701394493 10.1016/j.tcs.2020.12.013 10.1007/s00453-019-00623-3 10.1016/j.jspi.2010.01.020 10.1016/j.endm.2017.05.010 10.1080/0025570X.2000.11996878 10.1017/CBO9781139058520 10.47443/dml.2022.008 10.1016/S0012-365X(00)00150-3 10.1016/j.disc.2007.05.001 10.1109/IMCOM51814.2021.9377349 10.1016/S0012-365X(00)00147-3 10.1016/S0304-3975(02)00007-5 10.1016/j.jspi.2005.02.004 10.1016/0304-3975(94)90226-7 10.1007/s00236-004-0139-x 10.1016/j.disc.2015.11.001 10.1145/309739.309744 |
| ContentType | Journal Article |
| Copyright | COPYRIGHT 2024 MDPI AG 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: COPYRIGHT 2024 MDPI AG – notice: 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION 3V. 7SC 7TB 7XB 8AL 8FD 8FE 8FG 8FK ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO FR3 GNUQQ HCIFZ JQ2 K7- KR7 L6V L7M L~C L~D M0N M7S P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U DOA |
| DOI | 10.3390/math12081207 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Engineering Research Database ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Civil Engineering Abstracts ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Engineering Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Publicly Available Content Database Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection Advanced Technologies & Aerospace Collection Civil Engineering Abstracts ProQuest Computing Engineering Database ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) |
| DatabaseTitleList | CrossRef Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: DOA name: Directory of Open Access Journals (DOAJ) url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 2227-7390 |
| ExternalDocumentID | oai_doaj_org_article_b11f2b37bf4346489aa56e1d403cc9dd A793554850 10_3390_math12081207 |
| GroupedDBID | -~X 5VS 85S 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABJCF ABPPZ ABUWG ACIPV ACIWK ADBBV AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS AMVHM ARAPS AZQEC BCNDV BENPR BGLVJ BPHCQ CCPQU CITATION DWQXO GNUQQ GROUPED_DOAJ HCIFZ IAO ITC K6V K7- KQ8 L6V M7S MODMG M~E OK1 PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS RNS 3V. 7SC 7TB 7XB 8AL 8FD 8FK FR3 JQ2 KR7 L7M L~C L~D M0N P62 PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c363t-86720ed3d42a6ea144dd8f0c1f61d1c8b37dfc2802f42466f719086fa745933a3 |
| IEDL.DBID | BENPR |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001210110700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2227-7390 |
| IngestDate | Fri Oct 03 12:42:20 EDT 2025 Fri Jul 25 11:46:13 EDT 2025 Tue Nov 04 18:22:28 EST 2025 Sat Nov 29 07:12:27 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 8 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c363t-86720ed3d42a6ea144dd8f0c1f61d1c8b37dfc2802f42466f719086fa745933a3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-9695-7493 0000-0003-3412-432X |
| OpenAccessLink | https://www.proquest.com/docview/3046964118?pq-origsite=%requestingapplication% |
| PQID | 3046964118 |
| PQPubID | 2032364 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_b11f2b37bf4346489aa56e1d403cc9dd proquest_journals_3046964118 gale_infotracacademiconefile_A793554850 crossref_primary_10_3390_math12081207 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-04-01 |
| PublicationDateYYYYMMDD | 2024-04-01 |
| PublicationDate_xml | – month: 04 year: 2024 text: 2024-04-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Basel |
| PublicationPlace_xml | – name: Basel |
| PublicationTitle | Mathematics (Basel) |
| PublicationYear | 2024 |
| Publisher | MDPI AG |
| Publisher_xml | – name: MDPI AG |
| References | Prodinger (ref_9) 2022; 10 Banderier (ref_18) 2006; AG Merlini (ref_6) 2002; 101 Dziemianczuk (ref_21) 2016; 339 ref_36 ref_35 ref_34 ref_11 Barcucci (ref_27) 2021; 878–879 Shapiro (ref_13) 2000; 73 ref_30 Kuo (ref_28) 2015; 8 ref_19 ref_38 ref_37 Hartung (ref_33) 2022; 375 Mansour (ref_7) 2005; 9 Banderier (ref_12) 2005; 135 Banderier (ref_17) 2002; 281 Liebehenschel (ref_24) 2003; 32 Deutsch (ref_5) 1999; 204 Oste (ref_14) 2015; 22 Asinowski (ref_20) 2020; 82 ref_22 Chen (ref_15) 2008; 308 Flajolet (ref_32) 1994; 132 Humphreys (ref_1) 2010; 140 Liebehenschel (ref_23) 2021; 43 ref_3 Bacchelli (ref_31) 2004; 40 ref_2 ref_29 ref_26 Baril (ref_16) 2019; 342 Baril (ref_10) 2023; 26 ref_4 Duchon (ref_25) 2000; 225 Banderier (ref_8) 2017; 59 Petkovsek (ref_39) 2000; 225 |
| References_xml | – volume: 204 start-page: 167 year: 1999 ident: ref_5 article-title: Dyck path enumeration publication-title: Discret. Math. doi: 10.1016/S0012-365X(98)00371-9 – ident: ref_35 doi: 10.3390/a16060266 – ident: ref_3 doi: 10.1201/b18255 – ident: ref_19 doi: 10.1007/978-3-030-11102-1 – volume: 8 start-page: 190 year: 2015 ident: ref_28 article-title: From enumerating to generating: A linear time algorithm for generating 2D lattice paths with a given number of turns publication-title: Algorithms doi: 10.3390/a8020190 – volume: 342 start-page: 997 year: 2019 ident: ref_16 article-title: Enumeration of Lukasiewicz paths modulo some patterns publication-title: Discret. Math. doi: 10.1016/j.disc.2018.12.005 – volume: 101 start-page: 211 year: 2002 ident: ref_6 article-title: Some statistics on Dyck paths publication-title: J. Statist. Plann. Inference doi: 10.1016/S0378-3758(01)00180-X – ident: ref_11 doi: 10.3390/sym12040600 – ident: ref_34 doi: 10.3390/math8060962 – volume: 375 start-page: 2255 year: 2022 ident: ref_33 article-title: Combinatorial generation via permutation languages. I. Fundamentals publication-title: Trans. Amer. Math. Soc. doi: 10.1090/tran/8199 – volume: 22 start-page: P2.8 year: 2015 ident: ref_14 article-title: Motzkin paths, Motzkin polynomials and recurrence relations publication-title: Electron. J. Combin. doi: 10.37236/4781 – volume: 32 start-page: 880 year: 2003 ident: ref_24 article-title: Lexicographical generation of a generalized Dyck language publication-title: SIAM J. Comput. doi: 10.1137/S0097539701394493 – volume: 878–879 start-page: 47 year: 2021 ident: ref_27 article-title: Exhaustive generation of some lattice paths and their prefixes publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2020.12.013 – volume: 82 start-page: 386 year: 2020 ident: ref_20 article-title: Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata publication-title: Algorithmica doi: 10.1007/s00453-019-00623-3 – ident: ref_37 – volume: 140 start-page: 2237 year: 2010 ident: ref_1 article-title: A history and a survey of lattice path enumeration publication-title: J. Statist. Plann. Inference doi: 10.1016/j.jspi.2010.01.020 – volume: 43 start-page: B43d year: 2021 ident: ref_23 article-title: Ranking and unranking of a generalized Dyck language and the application to the generation of random trees publication-title: Sem. Lothar. Combin. – volume: 59 start-page: 131 year: 2017 ident: ref_8 article-title: Lattice paths with catastrophes publication-title: Electron. Notes Discret. Math. doi: 10.1016/j.endm.2017.05.010 – volume: 26 start-page: 23.3.2 year: 2023 ident: ref_10 article-title: Enumeration of Dyck paths with air pockets publication-title: J. Integer Seq. – volume: 73 start-page: 369 year: 2000 ident: ref_13 article-title: Bijections for the Schroder numbers publication-title: Math. Mag. doi: 10.1080/0025570X.2000.11996878 – ident: ref_2 doi: 10.1017/CBO9781139058520 – volume: 10 start-page: 9 year: 2022 ident: ref_9 article-title: Skew Dyck paths with catastrophes publication-title: Discret. Math. Lett. doi: 10.47443/dml.2022.008 – volume: 225 start-page: 121 year: 2000 ident: ref_25 article-title: On the enumeration and generation of generalized Dyck words publication-title: Discret. Math. doi: 10.1016/S0012-365X(00)00150-3 – ident: ref_4 – volume: 308 start-page: 2222 year: 2008 ident: ref_15 article-title: Riordan paths and derangements publication-title: Discret. Math. doi: 10.1016/j.disc.2007.05.001 – ident: ref_26 doi: 10.1109/IMCOM51814.2021.9377349 – ident: ref_29 – volume: 9 start-page: 06.1.5 year: 2005 ident: ref_7 article-title: Statistics on Dyck paths publication-title: J. Integer Seq. – volume: 225 start-page: 51 year: 2000 ident: ref_39 article-title: Linear recurrences with constant coefficients: The multivariate case publication-title: Discret. Math. doi: 10.1016/S0012-365X(00)00147-3 – volume: 281 start-page: 37 year: 2002 ident: ref_17 article-title: Basic analytic combinatorics of directed lattice paths publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(02)00007-5 – volume: 135 start-page: 40 year: 2005 ident: ref_12 article-title: Why Delannoy numbers? publication-title: J. Statist. Plann. Inference doi: 10.1016/j.jspi.2005.02.004 – volume: 132 start-page: 1 year: 1994 ident: ref_32 article-title: A calculus for the random generation of combinatorial structures publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(94)90226-7 – volume: 40 start-page: 585 year: 2004 ident: ref_31 article-title: Exhaustive generation of combinatorial objects by ECO publication-title: Acta Inform. doi: 10.1007/s00236-004-0139-x – ident: ref_38 – volume: 339 start-page: 1116 year: 2016 ident: ref_21 article-title: On directed lattice paths with vertical steps publication-title: Discret. Math. doi: 10.1016/j.disc.2015.11.001 – ident: ref_36 – ident: ref_22 – ident: ref_30 doi: 10.1145/309739.309744 – volume: AG start-page: 345 year: 2006 ident: ref_18 article-title: Analytic combinatorics of lattice paths: Enumeration and asymptotics for the area publication-title: Discrete Math. Theoret. Comput. Sci. |
| SSID | ssj0000913849 |
| Score | 2.251375 |
| Snippet | Graphs are a powerful tool for solving various mathematical problems. One such task is the representation of discrete structures. Combinatorial generation... |
| SourceID | doaj proquest gale crossref |
| SourceType | Open Website Aggregation Database Index Database |
| StartPage | 1207 |
| SubjectTerms | Algorithms AND/OR tree bijection Combinatorial analysis combinatorial generation directed lattice path Mathematical analysis Methods Queuing theory recurrence Representations |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8NAEF6keNCD-MRolRwUT6HZR_ZxEapYPGjpQaG3ZbMPK2iVJvr7nU3S0ot48bqEMHyz8_jI5BuELgoflLQl0JLSiCxW_Ex664HzWF9yYBwkhGbZhBiP5XSqJmurvuJMWCsP3AI3KDEOpKSiDIwyzqQypuAeO5ZTa5VzMfvmQq2RqSYHK0wlU-2kOwVeP4D-b4YJFEASN8eu1aBGqv-3hNxUmdEu2unaw3TYmrWHNvx8H20_rrRVqwN0DSEMdDaSZbg7aasbHeFNh28vcFbP3qsUWtG0zWbepQ-mjiNu6QReUx2i59Hd0-191m1ByCzltM4kFyT3jjpGDPcGCJBzMuQWB44dthKwccESmZPACOM8CKjxkgcjWKEoNfQI9eYfc3-M0iAEFOiipNADsRBwWRRWFR5bAaTOOpGgyyUu-rMVu9BAEiJ-eh2_BN1E0FbPRInq5gAcpzvH6b8cl6CrCLmOgVQvjDXd_wBgapSk0kMRpd-ZLPIE9Zde0V2EVTp-0VWcAT86-Q9rTtEWgXalncnpo169-PJnaNN-16_V4ry5XD9W5tOA priority: 102 providerName: Directory of Open Access Journals |
| Title | Combinatorial Generation Algorithms for Directed Lattice Paths |
| URI | https://www.proquest.com/docview/3046964118 https://doaj.org/article/b11f2b37bf4346489aa56e1d403cc9dd |
| Volume | 12 |
| WOSCitedRecordID | wos001210110700001&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: PRVAON databaseName: Directory of Open Access Journals (DOAJ) customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: DOA dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: M~E dateStart: 20130101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: K7- dateStart: 20130301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: M7S dateStart: 20130301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: BENPR dateStart: 20130301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2227-7390 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913849 issn: 2227-7390 databaseCode: PIMPY dateStart: 20130301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELZKywEOUF5iaVnlAOIUNX7Edi5UW7RVK-gq4iGVk-X40SK1u2UTOPa3M5N4t73QSy8-2FFkecYz89njbwh5V4ZYadcALGmsytHj5zq4AJjHhUYC4mAx9sUm1GymT0-rOh24tSmtcmUTe0PtFw7PyPfwBq-SAuLh_avfOVaNwtvVVELjAdlCpjLQ862D6az-uj5lQdZLLaoh450Dvt-DOPCcMnCEDCvI3vJFPWX__wxz720On953ntvkSYozs8mgGM_IRpg_J49P1iSt7QvyEWwB4GJE3aCE2UBAjXLKJhdn0NedX7YZxLTZYBaDz77YDnPlshp-074kPw6n3z8d5amcQu645F2upWJF8NwLZmWwgKS817FwNErqqdMNVz46pgsWBRNSRgXBgpbRKlFWnFv-imzOF_PwmmRRKfD0ZcMhmBIx0qYsXVUG6hSgQ-fViLxfLay5GlgzDKANFIC5LYAROcBVX3-DXNd9x2J5ZtLWMQ2lkcHkmii4kEJX1pYyUC8K7lzl_Yh8QJkZ3JHd0jqbHhbAVJHbykwUcsgLXRYjsruSmUlbtTU3Antz9_AOecQgohnSdnbJZrf8E96Sh-5v96tdjpPmjXtQD-1nlY8xkfQbttdTGK-PT-qf_wCly-gV |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB2VLRJw4LOoCwVyoOIUNbEd2zkA2kKrVt2uVqhIvRnHHy0S3S2bAOJP8RuZSbJLL3DrgWsSWU7m5c08ezwD8LIIsdSuQllSWZWSx091cAE1jwuVRMXBYmybTajJRJ-eltM1-LU8C0NplUtObInazx2tke_QDl4pBcbDby-_ptQ1inZXly00OlgchZ8_ULLVrw_fo323GdvfO3l3kPZdBVLHJW9SLRXLgudeMCuDRUHhvY6Zy6PMfe50xZWPjumMRcGElFGhz9QyWiUKVP-W47g3YF1wIYsBrO_uTaYfVqs6VGVTi7LLsOe8zHYw7jzPGTpeRh1rr_i-tkXA3xxB69327_1v3-U-3O3j6GTUAf8BrIXZQ7hzvCpCWz-CN8h1qPtpVQF_sqQrsE04TEZfzvBac35RJxizJx3tB5-MbUO5gMkUh6k34OO1vMBjGMzms7AJSVQKI5mi4hgsihjzqihcWYTcKVS_zqshbC8NaS67qiAG1RQZ3Fw1-BB2ycqrZ6iWd3thvjgzPTWYKs8jw8lVkTAldGltIUPuRcadK70fwivCiCHGaRbW2f7gBE6VaneZkaIa-UIX2RC2lhgxPRXV5g9Anvz79gu4dXByPDbjw8nRU7jNMHrrUpS2YNAsvoVncNN9bz7Xi-c96hP4dN2A-g3yBz4J |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VghAceBZ1oUAOVJyiTWzHjwOghbKialmtBEi9GT_bSrDbbgKIv8avY5zH0gvceuDqRJaT-TzzzXg8A_CsClFJZ9EtsUbkyeLnMriAPo8LlqPHQWJsm02I2UweHan5Bvwa7sKktMpBJ7aK2i9dipGP0wme4gz58Dj2aRHzvemrs_M8dZBKJ61DO40OIgfh5w903-oX-3so611Cpm8_vnmX9x0Gckc5bXLJBSmCp54Rw4NB58J7GQtXRl760klLhY-OyIJERhjnUaD9lDwawSpFqaE47xW4KhgvWJs2-GEd30n1NiVTXa49paoYIwM9KQmaYJJ6116wgm2zgL-ZhNbOTW__z3_oDtzq2XU26bbDXdgIi3tw8_26NG19H16iBrSnixRrwK2XdWW3EzqzyZdjHGtOvtYZMvmsMwbBZ4emSRmC2Rynqbfg06V8wAPYXCwXYRuyKATym8pSpJAsxtJWlVNVKJ1An9h5MYLdQaj6rKsVotHHSsLXF4U_gtdJ4ut3UoXvdmC5Ota9wtC2LCPBxdnIKONMKmMqHkrPCuqc8n4EzxNedNJDzco401-nwKWmil56IlLlfCarYgQ7A150r6Bq_QcsD__9-ClcRxTpw_3ZwSO4QZDSdXlLO7DZrL6Fx3DNfW9O69WTFv4ZfL5sNP0GsIlFgg |
| 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=Combinatorial+Generation+Algorithms+for+Directed+Lattice+Paths&rft.jtitle=Mathematics+%28Basel%29&rft.au=Shablya%2C+Yuriy&rft.au=Merinov%2C+Arsen&rft.au=Kruchinin%2C+Dmitry&rft.date=2024-04-01&rft.pub=MDPI+AG&rft.eissn=2227-7390&rft.volume=12&rft.issue=8&rft.spage=1207&rft_id=info:doi/10.3390%2Fmath12081207&rft.externalDBID=HAS_PDF_LINK |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2227-7390&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2227-7390&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2227-7390&client=summon |