Generic algorithms for some decision problems on fasciagraphs and rotagraphs
A fasciagraph consists of a sequence of copies of the same graph, each copy being linked to the next one according to a regular scheme. More precisely, a fasciagraph is characterized by an integer n (the number of copies or fibers) and a mixed graph M. In a rotagraph, the last copy is also linked to...
Saved in:
| Published in | Discrete mathematics Vol. 312; no. 17; pp. 2707 - 2719 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
06.09.2012
Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0012-365X 1872-681X |
| DOI | 10.1016/j.disc.2012.02.013 |
Cover
| Abstract | A fasciagraph consists of a sequence of copies of the same graph, each copy being linked to the next one according to a regular scheme. More precisely, a fasciagraph is characterized by an integer n (the number of copies or fibers) and a mixed graph M. In a rotagraph, the last copy is also linked to the first one. In the literature, similar methods were used to address various problems on rotagraphs and fasciagraphs. The goal of our work is to define a class of decision problems for which this kind of method works. For this purpose, we introduce the notion of pseudo-d-local q-properties of fasciagraphs and rotagraphs. For a mixed graph M and a pseudo-d-local q-property P, we propose a generic algorithm for rotagraphs (respectively, fasciagraphs) that computes in one run the data that allow one to decide, for any integer n≥d (respectively, n≥d+2), whether the rotagraph (respectively, fasciagraph) of length n based on M satisfies P, using only a small number of elementary operations independent of n. |
|---|---|
| AbstractList | A fasciagraph consists of a sequence of copies of the same graph, each copy being linked to the next one according to a regular scheme. More precisely, a fasciagraph is characterized by an integer n (the number of copies or fibers) and a mixed graph M. In a rotagraph, the last copy is also linked to the first one. In the literature, similar methods were used to address various problems on rotagraphs and fasciagraphs. The goal of our work is to define a class of decision problems for which this kind of method works. For this purpose, we introduce the notion of pseudo-d-local q-properties of fasciagraphs and rotagraphs. For a mixed graph M and a pseudo-d-local q-property P, we propose a generic algorithm for rotagraphs (respectively, fasciagraphs) that computes in one run the data that allow one to decide, for any integer n≥d (respectively, n≥d+2), whether the rotagraph (respectively, fasciagraph) of length n based on M satisfies P, using only a small number of elementary operations independent of n. A fasciagraph consists of a sequence of copies of the same graph, each copy being linked to the next one according to a regular scheme. More precisely, a fasciagraph is characterized by an integer n (the number of copies or fibers) and a mixed graph M . In a rotagraph, the last copy is also linked to the first one. In the literature, similar methods were used to address various problems on rotagraphs and fasciagraphs. The goal of our work is to define a class of decision problems for which this kind of method works. For this purpose, we introduce the notion of pseudo- d -local q -properties of fasciagraphs and rotagraphs. For a mixed graph M and a pseudo- d -local q -property P , we propose a generic algorithm for rotagraphs (respectively, fasciagraphs) that computes in one run the data that allow one to decide, for any integer n aY d (respectively, n aY d + 2 ), whether the rotagraph (respectively, fasciagraph) of length n based on M satisfies P , using only a small number of elementary operations independent of n . A fasciagraph consists of a sequence of copies of the same graph, each copy being linked to the next one according to a regular scheme. More precisely, a fasciagraph is characterized by an integer n (the number of copies or fibers) and a mixed graph M. In a rotagraph, the last copy is also linked to the first one. In the literature, similar methods were used to address various problems on rotagraphs and fasciagraphs. The goal of our work is to define a class of decision problems for which this kind of method works. For this purpose, we introduce the notion of pseudo-d-local q-properties of fasciagraphs and rotagraphs. For a mixed graph M and a pseudo-d-local q-property P, we propose a generic algorithm for rotagraphs (respectively, fasciagraphs) that computes in one run the data that allow one to decide, for any integer n >= d (respectively, n >= d + 2), whether the rotagraph (respectively, fasciagraph) of length n based on M satisfies P, using only a small number of elementary operations independent of n. |
| Author | Bouznif, Marwane Preissmann, Myriam Moncel, Julien |
| Author_xml | – sequence: 1 givenname: Marwane surname: Bouznif fullname: Bouznif, Marwane email: marwane.bouznif@g-scop.fr organization: Grenoble-INP / UJF-Grenoble 1 / CNRS, G-SCOP UMR5272 Grenoble, F-38031, France – sequence: 2 givenname: Julien surname: Moncel fullname: Moncel, Julien email: julien.moncel@iut-rodez.fr organization: CNRS; LAAS; 7 avenue du colonel Roche, F-31077 Toulouse Cedex 4, France – sequence: 3 givenname: Myriam surname: Preissmann fullname: Preissmann, Myriam email: myriam.preissmann@g-scop.fr organization: Grenoble-INP / UJF-Grenoble 1 / CNRS, G-SCOP UMR5272 Grenoble, F-38031, France |
| BackLink | https://hal.science/hal-00802165$$DView record in HAL |
| BookMark | eNp9kE1LAzEQhoNUsK3-AU971MOumWS_BC8iWoWCFw_ewmwy26ZsNzXZCv57U7dePAgDM5N53yHzzNikdz0xdgk8Aw7lzSYzNuhMcBAZjwHyhE2hrkRa1vA-YVMeJ6ksi_czNgthw2NfynrKlgvqyVudYLdy3g7rbUha55PgtpQY0jZY1yc775qO4ijWLQZtceVxtw4J9ibxbji25-y0xS7QxTHP2dvT49vDc7p8Xbw83C9TLctqSJuSo9C3WjYg8xrrXFMrq4qQa2iKkjRhrgsyooDGUIOmbYq8bUEWYKpbknN2Pa5dY6d23m7RfymHVj3fL9XhjfOaCyiLT4jaq1EbT_jYUxjUNoKirsOe3D4o4LUQUOQgo7Qepdq7EDy1StsBh3j_4NF2UaoOrNVGHVirA2vFY_xYxR_r77f-Nd2NJoqoPi15FcFSr8lYT3pQxtn_7N9tXpuL |
| CitedBy_id | crossref_primary_10_1016_j_dam_2016_03_009 |
| Cites_doi | 10.1016/S0166-218X(97)00069-3 10.1016/j.tcs.2004.02.007 10.1016/j.disc.2005.09.047 10.1016/j.disc.2005.09.036 10.1016/j.dam.2004.01.019 10.1021/ci00027a007 10.1016/S0166-218X(02)00597-8 10.1007/978-3-7091-9076-0_2 10.1016/0166-218X(95)00058-Y |
| ContentType | Journal Article |
| Copyright | 2012 Elsevier B.V. Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2012 Elsevier B.V. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC |
| DOI | 10.1016/j.disc.2012.02.013 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1872-681X |
| EndPage | 2719 |
| ExternalDocumentID | oai:HAL:hal-00802165v1 10_1016_j_disc_2012_02_013 S0012365X12000854 |
| GroupedDBID | --K --M -DZ -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6I. 6OB 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AASFE AAXUO ABAOU ABJNI ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACRLP ADBBV ADEZE ADIYS ADMUD AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR AXJTR BKOJK BLXMC CS3 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA HVGLF HZ~ IHE IXB J1W KOM M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SDF SDG SDP SES SPC SPCBC SSW SSZ T5K TN5 UPT WH7 XPP ZMT ~G- 29G 41~ 6TJ AAQXK AATTM AAXKI AAYWO AAYXX ABEFU ABFNM ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FA8 FGOYB G-2 MVM R2- RNS SEW VH1 WUQ XJT XOL ZCG ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D 1XC ABUFD |
| ID | FETCH-LOGICAL-c367t-b60a2c9c3b1348a84cef377ea0c1b56ecea4c5ed251bdebadfb54ff1351d79e3 |
| IEDL.DBID | .~1 |
| ISSN | 0012-365X |
| IngestDate | Sat Oct 25 06:44:30 EDT 2025 Sun Sep 28 01:10:23 EDT 2025 Thu Apr 24 23:12:58 EDT 2025 Wed Oct 01 04:49:33 EDT 2025 Fri Feb 23 02:17:05 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 17 |
| Keywords | Grids Algorithmic complexity Rotagraphs Combinatorial optimization Fasciagraphs NP-Hard problems |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c367t-b60a2c9c3b1348a84cef377ea0c1b56ecea4c5ed251bdebadfb54ff1351d79e3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ORCID | 0000-0002-3484-6755 0000-0002-5138-1582 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S0012365X12000854 |
| PQID | 1082215413 |
| PQPubID | 23500 |
| PageCount | 13 |
| ParticipantIDs | hal_primary_oai_HAL_hal_00802165v1 proquest_miscellaneous_1082215413 crossref_citationtrail_10_1016_j_disc_2012_02_013 crossref_primary_10_1016_j_disc_2012_02_013 elsevier_sciencedirect_doi_10_1016_j_disc_2012_02_013 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2012-09-06 |
| PublicationDateYYYYMMDD | 2012-09-06 |
| PublicationDate_xml | – month: 09 year: 2012 text: 2012-09-06 day: 06 |
| PublicationDecade | 2010 |
| PublicationTitle | Discrete mathematics |
| PublicationYear | 2012 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Marwane Bouznif, Julien Moncel, Myriam Preissmann, Optimization algorithms for rotagraphs and fasciagraphs, manuscript. Žerovnik (br000070) 1999; vol. 1684 Van Wieren (br000065) 2007; 307 Daniel, Gravier, Moncel (br000005) 2004; 319 Juvan, Mohar, Graovac, Klavžar, Žerovnik (br000030) 1995; 35 Klavžar, Žerovnik (br000050) 1996; 68 Gravier, Moncel, Payan (br000015) 2007; 307 Gondran, Minoux (br000010) 2008 Juvan, Mohar, Žerovnik (br000035) 1997; 80 Günther (br000020) 1983; 14 Janez Žerovnik, Deriving formulas for the pentomino exclusion problem, Preprint Series, 42, 2004. Möhring (br000060) 1990; 7 Jha, Klavzar, Vesel (br000025) 2005; 145 Klavžar, Vesel (br000045) 2003; 129 Juvan, Petkovšek, Graovac, Vesel, Žerovnik (br000040) 2003; 49 Livingston, Stout (br000055) 1994; 105 10.1016/j.disc.2012.02.013_br000075 Van Wieren (10.1016/j.disc.2012.02.013_br000065) 2007; 307 Jha (10.1016/j.disc.2012.02.013_br000025) 2005; 145 Livingston (10.1016/j.disc.2012.02.013_br000055) 1994; 105 Daniel (10.1016/j.disc.2012.02.013_br000005) 2004; 319 Gondran (10.1016/j.disc.2012.02.013_br000010) 2008 Möhring (10.1016/j.disc.2012.02.013_br000060) 1990; 7 Juvan (10.1016/j.disc.2012.02.013_br000035) 1997; 80 Žerovnik (10.1016/j.disc.2012.02.013_br000070) 1999; vol. 1684 Günther (10.1016/j.disc.2012.02.013_br000020) 1983; 14 Klavžar (10.1016/j.disc.2012.02.013_br000045) 2003; 129 Juvan (10.1016/j.disc.2012.02.013_br000030) 1995; 35 Klavžar (10.1016/j.disc.2012.02.013_br000050) 1996; 68 10.1016/j.disc.2012.02.013_br000080 Gravier (10.1016/j.disc.2012.02.013_br000015) 2007; 307 Juvan (10.1016/j.disc.2012.02.013_br000040) 2003; 49 |
| References_xml | – year: 2008 ident: br000010 publication-title: Graphs, Dioids and Semirings: New Models and Algorithms – volume: 307 start-page: 435 year: 2007 end-page: 444 ident: br000015 article-title: A generalization of the pentomino exclusion problem: dislocation of graphs publication-title: Discrete Mathematics – volume: 68 start-page: 93 year: 1996 end-page: 100 ident: br000050 article-title: Algebraic approach to fasciagraphs and rotagraphs publication-title: Discrete Applied Mathematics – volume: vol. 1684 start-page: 559 year: 1999 end-page: 568 ident: br000070 article-title: Deriving formulas for domination numbers of fasciagraphs and rotagraphs publication-title: Proceedings of the 12th International Symposium on Fundamentals of Computation Theory – volume: 80 start-page: 57 year: 1997 end-page: 71 ident: br000035 article-title: Distance-related invariants on polygraphs publication-title: Discrete Applied Mathematics – volume: 7 start-page: 17 year: 1990 end-page: 51 ident: br000060 article-title: Graph problems related to gate matrix layout and PLA folding publication-title: Computing Supplement – volume: 105 start-page: 116 year: 1994 end-page: 128 ident: br000055 article-title: Constant time computation of minimum dominating sets publication-title: Congressus Numerantium – volume: 145 start-page: 317 year: 2005 end-page: 325 ident: br000025 article-title: L(2,1)-labeling of direct product of paths and cycles publication-title: Discrete Applied Mathematics – volume: 49 start-page: 47 year: 2003 end-page: 66 ident: br000040 article-title: The Szeged index of fasciagraphs publication-title: MATCH Communication in Mathematical and in Computer Chemistry – volume: 129 start-page: 449 year: 2003 end-page: 460 ident: br000045 article-title: Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers publication-title: Discrete Applied Mathematics – reference: Marwane Bouznif, Julien Moncel, Myriam Preissmann, Optimization algorithms for rotagraphs and fasciagraphs, manuscript. – volume: 14 start-page: 3 year: 1983 end-page: 42 ident: br000020 article-title: The automorphism group of roto—and fasciagraphs publication-title: MATCH Communications in Mathematical and in Computer Chemistry – volume: 319 start-page: 411 year: 2004 end-page: 421 ident: br000005 article-title: Identifying codes in some subgraphs of the square lattice publication-title: Theoretical Computer Science – volume: 307 start-page: 615 year: 2007 end-page: 632 ident: br000065 article-title: Critical cyclic patterns related to the domination number of the torus publication-title: Discrete Mathematics – reference: Janez Žerovnik, Deriving formulas for the pentomino exclusion problem, Preprint Series, 42, 2004. – volume: 35 start-page: 834 year: 1995 end-page: 840 ident: br000030 article-title: Fast computation of the Wiener index of fasciagraphs and rotagraphs publication-title: Journal of Chemical Information and Computer Sciences – year: 2008 ident: 10.1016/j.disc.2012.02.013_br000010 – volume: 80 start-page: 57 issue: 1 year: 1997 ident: 10.1016/j.disc.2012.02.013_br000035 article-title: Distance-related invariants on polygraphs publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(97)00069-3 – volume: 319 start-page: 411 issue: 1–3 year: 2004 ident: 10.1016/j.disc.2012.02.013_br000005 article-title: Identifying codes in some subgraphs of the square lattice publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2004.02.007 – volume: 49 start-page: 47 year: 2003 ident: 10.1016/j.disc.2012.02.013_br000040 article-title: The Szeged index of fasciagraphs publication-title: MATCH Communication in Mathematical and in Computer Chemistry – volume: 14 start-page: 3 year: 1983 ident: 10.1016/j.disc.2012.02.013_br000020 article-title: The automorphism group of roto—and fasciagraphs publication-title: MATCH Communications in Mathematical and in Computer Chemistry – volume: 307 start-page: 615 issue: 3–5 year: 2007 ident: 10.1016/j.disc.2012.02.013_br000065 article-title: Critical cyclic patterns related to the domination number of the torus publication-title: Discrete Mathematics doi: 10.1016/j.disc.2005.09.047 – volume: vol. 1684 start-page: 559 year: 1999 ident: 10.1016/j.disc.2012.02.013_br000070 article-title: Deriving formulas for domination numbers of fasciagraphs and rotagraphs – volume: 307 start-page: 435 issue: 3–5 year: 2007 ident: 10.1016/j.disc.2012.02.013_br000015 article-title: A generalization of the pentomino exclusion problem: dislocation of graphs publication-title: Discrete Mathematics doi: 10.1016/j.disc.2005.09.036 – volume: 145 start-page: 317 issue: 2 year: 2005 ident: 10.1016/j.disc.2012.02.013_br000025 article-title: L(2,1)-labeling of direct product of paths and cycles publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2004.01.019 – ident: 10.1016/j.disc.2012.02.013_br000075 – volume: 105 start-page: 116 year: 1994 ident: 10.1016/j.disc.2012.02.013_br000055 article-title: Constant time computation of minimum dominating sets publication-title: Congressus Numerantium – volume: 35 start-page: 834 issue: 5 year: 1995 ident: 10.1016/j.disc.2012.02.013_br000030 article-title: Fast computation of the Wiener index of fasciagraphs and rotagraphs publication-title: Journal of Chemical Information and Computer Sciences doi: 10.1021/ci00027a007 – volume: 129 start-page: 449 issue: 2–3 year: 2003 ident: 10.1016/j.disc.2012.02.013_br000045 article-title: Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(02)00597-8 – volume: 7 start-page: 17 year: 1990 ident: 10.1016/j.disc.2012.02.013_br000060 article-title: Graph problems related to gate matrix layout and PLA folding publication-title: Computing Supplement doi: 10.1007/978-3-7091-9076-0_2 – ident: 10.1016/j.disc.2012.02.013_br000080 – volume: 68 start-page: 93 issue: 1–2 year: 1996 ident: 10.1016/j.disc.2012.02.013_br000050 article-title: Algebraic approach to fasciagraphs and rotagraphs publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(95)00058-Y |
| SSID | ssj0001638 |
| Score | 1.9804993 |
| Snippet | A fasciagraph consists of a sequence of copies of the same graph, each copy being linked to the next one according to a regular scheme. More precisely, a... |
| SourceID | hal proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 2707 |
| SubjectTerms | [formula omitted]-Hard problems Algorithmic complexity Algorithms Combinatorial optimization Computer Science Discrete Mathematics Fasciagraphs Fibers Graphs Grids Integers Mathematical models Reproduction Rotagraphs |
| Title | Generic algorithms for some decision problems on fasciagraphs and rotagraphs |
| URI | https://dx.doi.org/10.1016/j.disc.2012.02.013 https://www.proquest.com/docview/1082215413 https://hal.science/hal-00802165 |
| Volume | 312 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1872-681X dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001638 issn: 0012-365X databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier ScienceDirect Open Access Journals customDbUrl: eissn: 1872-681X dateEnd: 20211102 omitProxy: true ssIdentifier: ssj0001638 issn: 0012-365X databaseCode: IXB dateStart: 19710501 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection [SCCMFC] customDbUrl: eissn: 1872-681X dateEnd: 20211102 omitProxy: true ssIdentifier: ssj0001638 issn: 0012-365X databaseCode: ACRLP dateStart: 19950120 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Science Direct customDbUrl: eissn: 1872-681X dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001638 issn: 0012-365X databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect Journal Collection customDbUrl: eissn: 1872-681X dateEnd: 20211031 omitProxy: true ssIdentifier: ssj0001638 issn: 0012-365X databaseCode: AIKHN dateStart: 19950120 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-681X dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001638 issn: 0012-365X databaseCode: AKRWK dateStart: 19710501 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PT9swFLZKdxmHCbYhOqAyE7cpEMeOkxwLomoZcGJSb5Z_QhGkiLQc97fPz3E6bRIckHKILUdxnpP3vsjf-x5CR6lWXDJiEldqljAfsJLK5C6hPhYUhcmq1AS2xTWf_GIXs3zWQ2ddLgzQKqPvb3168Nax5yRa8-RpPoccX1AOyWckC8ABNEEZK6CKwfHvvzQPwButN84SGB0TZ1qOF2S-Ar0rC7qdhL4WnDbugCX5n7MOEWi8hT5F6IhH7ey2Uc_Wn9Hm1Vp3tfmCLoOK9Fxj-XC78L_9d48N9qgUN4tHi00sp4NjEZkG-3Mn_VPLIFvdYFkb_Az7VKH5Fd2Mz2_OJkmsl5BoyotlongqM11pqghlpSyZto4WhZWpJirnVlvJdG6NhzTKWCWNUzlzDmr0maKydAf160VtdxF2ipRcEuYqaZmyXFFZVh7qaVpZVig5QKSzk9BRSxxKWjyIjjR2L8C2AmwrUn8QOkA_1tc8tUoab47OO_OLf94H4V39m9d992u1vgGIZ09GlwL6Qlox4fkLGaDDbimF_5pgi0TWdrFqQC418yDIR_Zv75zAHvoIrUBD4_uov3xe2QOPW5ZqGF7MIfowmv6cXPvWdHb6B9SO7gI |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB615QA9IJ5iCwWDuKHQOH4kOVYV1QLbnhZpb5afdFGbrZptj_3teBxnUZHoASmHxEkUZ5zMfJa_-QbgY2mN1Jy6IjSWFzwGrKJ1IhQsxoK6dlVbusS2OJXTH_zbQiy24GjMhUFaZfb9g09P3jq3HGRrHlwul5jji8ohYkGrBBz4NjzgoqpxBvb59g_PAwHH4I6rAi_PmTMDyQtTX5HfVSXhTsr-FZ22z5Am-Ze3TiHo-Ak8ztiRHA7dewpbvnsGuycb4dX-OcySjPTSEn3-cxXn_WcXPYmwlPSrC09crqdDchWZnsT9oONr66Rb3RPdOXKFC1Xp8AXMj7_Mj6ZFLphQWCbrdWFkqSvbWmYo441uuPWB1bXXpaVGSG-95lZ4FzGNcd5oF4zgIWCRPle3nr2EnW7V-VdAgqGN1JSHVntuvDRMN23Eepa1ntdGT4COdlI2i4ljTYtzNbLGfim0rULbqjJulE3g0-aey0FK496rxWh-deeDUNHX33vfhzhWmwegevb0cKawLeUVUylu6ATej0Op4u-EayS686vrHvVSq4iCYmjf-88OvIOH0_nJTM2-nn5_DY_wTOKkyTews7669vsRxKzN2_SR_gbJIO6T |
| 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=Generic+algorithms+for+some+decision+problems+on+fasciagraphs+and+rotagraphs&rft.jtitle=Discrete+mathematics&rft.au=Bouznif%2C+Marwane&rft.au=Moncel%2C+Julien&rft.au=Preissmann%2C+Myriam&rft.date=2012-09-06&rft.issn=0012-365X&rft.volume=312&rft.issue=17&rft.spage=2707&rft.epage=2719&rft_id=info:doi/10.1016%2Fj.disc.2012.02.013&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0012-365X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0012-365X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0012-365X&client=summon |