Fast rule-based graph programs
•Rooted rules are essential for fast rule-based graph algorithms.•Cycle graphs, trees, binary DAGs can be recognised by graph reduction in linear time.•Topological sorting has a linear-time implementation in the rule-based language GP2.•Depth-first search and 2-colouring have linear-time implementat...
Uložené v:
| Vydané v: | Science of computer programming Ročník 214; s. 102727 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.02.2022
|
| Predmet: | |
| ISSN: | 0167-6423, 1872-7964 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •Rooted rules are essential for fast rule-based graph algorithms.•Cycle graphs, trees, binary DAGs can be recognised by graph reduction in linear time.•Topological sorting has a linear-time implementation in the rule-based language GP2.•Depth-first search and 2-colouring have linear-time implementations in GP2.
Implementing graph algorithms efficiently in a rule-based language is challenging because graph pattern matching is expensive. In this paper, we present a number of linear-time implementations of graph algorithms in GP 2, an experimental programming language based on graph transformation rules which aims to facilitate program analysis and verification. We focus on two classes of rule-based graph programs: graph reduction programs which check some graph property, and programs using a depth-first search to test some property or perform an operation such as producing a 2-colouring or a topological sorting. Programs of the first type run in linear time without any constraints on input graphs while programs of the second type require input graphs of bounded degree to run in linear time. Essential for achieving the linear time complexity are so-called rooted rules in GP 2, which, in many situations, can be matched in constant time. For each of our programs, we prove both correctness and complexity, and also give empirical evidence for their runtime. |
|---|---|
| AbstractList | •Rooted rules are essential for fast rule-based graph algorithms.•Cycle graphs, trees, binary DAGs can be recognised by graph reduction in linear time.•Topological sorting has a linear-time implementation in the rule-based language GP2.•Depth-first search and 2-colouring have linear-time implementations in GP2.
Implementing graph algorithms efficiently in a rule-based language is challenging because graph pattern matching is expensive. In this paper, we present a number of linear-time implementations of graph algorithms in GP 2, an experimental programming language based on graph transformation rules which aims to facilitate program analysis and verification. We focus on two classes of rule-based graph programs: graph reduction programs which check some graph property, and programs using a depth-first search to test some property or perform an operation such as producing a 2-colouring or a topological sorting. Programs of the first type run in linear time without any constraints on input graphs while programs of the second type require input graphs of bounded degree to run in linear time. Essential for achieving the linear time complexity are so-called rooted rules in GP 2, which, in many situations, can be matched in constant time. For each of our programs, we prove both correctness and complexity, and also give empirical evidence for their runtime. |
| ArticleNumber | 102727 |
| Author | Courtehoute, Brian Campbell, Graham Plump, Detlef |
| Author_xml | – sequence: 1 givenname: Graham orcidid: 0000-0002-6767-2747 surname: Campbell fullname: Campbell, Graham email: g.j.campbell2@newcastle.ac.uk organization: School of Mathematics, Statistics and Physics, Newcastle University, Newcastle upon Tyne, United Kingdom – sequence: 2 givenname: Brian orcidid: 0000-0002-7736-4852 surname: Courtehoute fullname: Courtehoute, Brian email: bc956@york.ac.uk organization: Department of Computer Science, University of York, York, United Kingdom – sequence: 3 givenname: Detlef surname: Plump fullname: Plump, Detlef email: detlef.plump@york.ac.uk organization: Department of Computer Science, University of York, York, United Kingdom |
| BookMark | eNqFj81KxDAUhYOMYGf0CQTpC7Tmp6btwoUMzigMuNF1uE1uNKXTliQKvr2tdeVCV_dwOd-Bb01W_dAjIZeM5owyed3mQTs95JxyNn14ycsTkrCq5FlZy2JFkqlVZrLg4oysQ2gppbIoWUKudhBi6t87zBoIaNJXD-NbOvphCsdwTk4tdAEvfu6GvOzun7cP2eFp_7i9O2RaFFXMAG4MWiYM1cZWWDe2gpoJWVS6kcApQoO05oYKZo2FygqUokGthbBcUCk2RCy72g8heLRq9O4I_lMxqmZF1apvRTUrqkVxoupflHYRohv66MF1_7C3C4uT1odDP3ew12icRx2VGdyf_BesP2_S |
| CitedBy_id | crossref_primary_10_1016_j_jlamp_2022_100825 crossref_primary_10_4204_EPTCS_417_3 |
| Cites_doi | 10.1007/978-3-030-54256-6 10.1007/978-3-662-47980-3 10.1007/s10009-011-0186-x 10.1007/s10009-010-0148-8 10.3233/FI-2012-708 10.1016/j.jlamp.2016.12.001 10.1016/j.scico.2013.10.009 10.1007/s10270-006-0027-7 10.1017/S0960129518000270 |
| ContentType | Journal Article |
| Copyright | 2021 The Author(s) |
| Copyright_xml | – notice: 2021 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.scico.2021.102727 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-7964 |
| ExternalDocumentID | 10_1016_j_scico_2021_102727 S0167642321001209 |
| GrantInformation_xml | – fundername: Engineering and Physical Sciences Research Council grantid: 2281162 funderid: https://doi.org/10.13039/501100000266 |
| GroupedDBID | --K --M .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABJNI ABMAC ABYKQ ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 ROL RPZ SDF SDG SDP SES SPC SPCBC SSV T5K TN5 XPP ZMT ~G- 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADHUB ADMUD ADNMO ADVLN AEIPS AEUPX AFFNX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FGOYB G-2 HZ~ R2- SEW SSZ WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c348t-aa5def13d0cdf8e9bf8a913648cb6a20eabe092d031fdfa8f3e63becc33f23063 |
| ISICitedReferencesCount | 8 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000720929000010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-6423 |
| IngestDate | Sat Nov 29 07:23:34 EST 2025 Tue Nov 18 21:54:30 EST 2025 Fri Feb 23 02:42:56 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Graph reduction Graph transformation Rooted graph programs Linear-time algorithms Depth-first search |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c348t-aa5def13d0cdf8e9bf8a913648cb6a20eabe092d031fdfa8f3e63becc33f23063 |
| ORCID | 0000-0002-7736-4852 0000-0002-6767-2747 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.scico.2021.102727 |
| ParticipantIDs | crossref_primary_10_1016_j_scico_2021_102727 crossref_citationtrail_10_1016_j_scico_2021_102727 elsevier_sciencedirect_doi_10_1016_j_scico_2021_102727 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-02-01 2022-02-00 |
| PublicationDateYYYYMMDD | 2022-02-01 |
| PublicationDate_xml | – month: 02 year: 2022 text: 2022-02-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Science of computer programming |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Plotkin (br0320) 2004; 60–61 Sedgewick (br0190) 2002 Wulandari, Plump (br0140) 2021; vol. 12741 Poskitt, Plump (br0110) 2012; 118 Runge, Ermel, Taentzer (br0020) 2011; vol. 7233 Poskitt, Plump (br0120) 2014; vol. 8571 Campbell, Courtehoute, Plump (br0210) 2019; vol. 139 Groner, Gylstorff, Tichy (br0300) 2020 Agrawal, Karsai, Neema, Shi, Vizhanyo (br0030) 2006; 5 Ehrig, Ermel, Golas, Hermann (br0010) 2015 Habel, Plump (br0230) 2002; vol. 2505 Cormen, Leiserson, Rivest, Stein (br0280) 2009 Bak (br0220) 2015 Aho, Hopcroft, Ullman (br0240) 1974 Hristakiev, Plump (br0150) 2018; vol. 10748 Ghamarian, de Mol, Rensink, Zambon, Zimakova (br0040) 2012; 14 Stalker (br0310) 2020 Bak, Plump (br0180) 2016; vol. 9761 Strüber, Born, Gill, Groner, Kehrer, Ohrndorf, Tichy (br0070) 2017; vol. 10373 Coutehoute, Plump (br0290) 2020; vol. 330 Skiena (br0250) 2020 Dörr (br0160) 1995; vol. 922 Wulandari, Plump (br0130) 2018; vol. 11176 Campbell, Romö, Plump (br0200) 2020 Jakumeit, Buchwald, Kroll (br0060) 2010; 12 Jakumeit, Buchwald, Wagelaar, Dan, Hegedüs, Herrmannsdörfer, Horn, Kalnina, Krause, Lano, Rensink, Rose, Wätzoldt, Lepper, Mazanek (br0050) 2014; 85 Bak, Plump (br0170) 2012; vol. 54 Plump (br0090) 2012; vol. 82 Fernández, Kirchner, Pinaud (br0080) 2019; 29 Zündorf (br0260) 1996; vol. 1073 Campbell (br0270) 2019 Plump (br0100) 2017; 88 Skiena (10.1016/j.scico.2021.102727_br0250) 2020 Wulandari (10.1016/j.scico.2021.102727_br0140) 2021; vol. 12741 Plump (10.1016/j.scico.2021.102727_br0100) 2017; 88 Aho (10.1016/j.scico.2021.102727_br0240) 1974 Groner (10.1016/j.scico.2021.102727_br0300) 2020 Sedgewick (10.1016/j.scico.2021.102727_br0190) 2002 Habel (10.1016/j.scico.2021.102727_br0230) 2002; vol. 2505 Poskitt (10.1016/j.scico.2021.102727_br0120) 2014; vol. 8571 Agrawal (10.1016/j.scico.2021.102727_br0030) 2006; 5 Fernández (10.1016/j.scico.2021.102727_br0080) 2019; 29 Cormen (10.1016/j.scico.2021.102727_br0280) 2009 Jakumeit (10.1016/j.scico.2021.102727_br0050) 2014; 85 Runge (10.1016/j.scico.2021.102727_br0020) 2011; vol. 7233 Campbell (10.1016/j.scico.2021.102727_br0210) 2019; vol. 139 Jakumeit (10.1016/j.scico.2021.102727_br0060) 2010; 12 Campbell (10.1016/j.scico.2021.102727_br0270) 2019 Zündorf (10.1016/j.scico.2021.102727_br0260) 1996; vol. 1073 Plump (10.1016/j.scico.2021.102727_br0090) 2012; vol. 82 Poskitt (10.1016/j.scico.2021.102727_br0110) 2012; 118 Coutehoute (10.1016/j.scico.2021.102727_br0290) 2020; vol. 330 Bak (10.1016/j.scico.2021.102727_br0220) 2015 Wulandari (10.1016/j.scico.2021.102727_br0130) 2018; vol. 11176 Bak (10.1016/j.scico.2021.102727_br0180) 2016; vol. 9761 Stalker (10.1016/j.scico.2021.102727_br0310) 2020 Hristakiev (10.1016/j.scico.2021.102727_br0150) 2018; vol. 10748 Ehrig (10.1016/j.scico.2021.102727_br0010) 2015 Strüber (10.1016/j.scico.2021.102727_br0070) 2017; vol. 10373 Plotkin (10.1016/j.scico.2021.102727_br0320) 2004; 60–61 Dörr (10.1016/j.scico.2021.102727_br0160) 1995; vol. 922 Bak (10.1016/j.scico.2021.102727_br0170) 2012; vol. 54 Campbell (10.1016/j.scico.2021.102727_br0200) 2020 Ghamarian (10.1016/j.scico.2021.102727_br0040) 2012; 14 |
| References_xml | – year: 2020 ident: br0250 article-title: The Algorithm Design Manual publication-title: Texts in Computer Science – volume: vol. 330 start-page: 163 year: 2020 end-page: 180 ident: br0290 article-title: A fast graph program for computing minimum spanning trees publication-title: Proc. Eleventh International Workshop on Graph Computation Models (GCM 2020) – year: 2020 ident: br0200 article-title: The improved GP – volume: vol. 922 year: 1995 ident: br0160 article-title: Efficient Graph Rewriting and Its Implementation publication-title: Lecture Notes in Computer Science – year: 2020 ident: br0300 article-title: A profiler for the matching process of Henshin publication-title: Proc. 23rd International Conference on Model Driven Engineering Languages and Systems (MODELS 2020) – volume: vol. 7233 start-page: 81 year: 2011 end-page: 88 ident: br0020 article-title: AGG 2.0 – new features for specifying and analyzing algebraic graph transformations publication-title: Proc. 4th International Symposium on Applications of Graph Transformations with Industrial Relevance (AGTIVE 2011) – volume: 5 start-page: 261 year: 2006 end-page: 288 ident: br0030 article-title: The design of a language for model transformations publication-title: Softw. Syst. Model. – volume: 88 start-page: 154 year: 2017 end-page: 173 ident: br0100 article-title: From imperative to rule-based graph programs publication-title: J. Log. Algebraic Methods Program. – volume: vol. 12741 start-page: 240 year: 2021 end-page: 261 ident: br0140 article-title: Verifying graph programs with monadic second-order logic publication-title: Proc. 14th International Conference on Graph Transformation (ICGT 2021) – year: 2020 ident: br0310 article-title: Runtime checking of graph programs – volume: vol. 8571 start-page: 33 year: 2014 end-page: 48 ident: br0120 article-title: Verifying monadic second-order properties of graph programs publication-title: Proc. 7th International Conference on Graph Transformation (ICGT 2014) – volume: 12 start-page: 263 year: 2010 end-page: 271 ident: br0060 article-title: GrGen.NET – the expressive, convenient and fast graph rewrite system publication-title: Int. J. Softw. Tools Technol. Transf. – volume: vol. 1073 start-page: 454 year: 1996 end-page: 468 ident: br0260 article-title: Graph pattern matching in PROGRES publication-title: Proc. 5th International Workshop on Graph Grammars and Their Application to Computer Science (1994) – year: 2009 ident: br0280 article-title: Introduction to Algorithms – volume: vol. 9761 start-page: 102 year: 2016 end-page: 117 ident: br0180 article-title: Compiling graph programs to C publication-title: Proc. 9th International Conference on Graph Transformation (ICGT 2016) – volume: vol. 82 start-page: 1 year: 2012 end-page: 16 ident: br0090 article-title: The design of GP publication-title: Proc. 10th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011) – year: 2015 ident: br0220 article-title: GP – volume: 118 start-page: 135 year: 2012 end-page: 175 ident: br0110 article-title: Hoare-style verification of graph programs publication-title: Fundam. Inform. – volume: vol. 10373 start-page: 196 year: 2017 end-page: 208 ident: br0070 article-title: Henshin: a usability-focused framework for EMF model transformation development publication-title: Proc. 10th International Conference on Graph Transformation (ICGT 2017) – year: 2019 ident: br0270 article-title: Efficient graph rewriting – volume: 14 start-page: 15 year: 2012 end-page: 40 ident: br0040 article-title: Modelling and analysis using GROOVE publication-title: Int. J. Softw. Tools Technol. Transf. – volume: vol. 10748 start-page: 92 year: 2018 end-page: 108 ident: br0150 article-title: Checking graph programs for confluence publication-title: Software Technologies: Applications and Foundations – STAF 2017 Collocated Workshops, Revised Selected Papers – year: 1974 ident: br0240 article-title: The Design and Analysis of Computer Algorithms – year: 2015 ident: br0010 article-title: Graph and Model Transformation publication-title: Monographs in Theoretical Computer Science – year: 2002 ident: br0190 article-title: Algorithms in C. Part 5: Graph Algorithms – volume: 85 start-page: 41 year: 2014 end-page: 99 ident: br0050 article-title: A survey and comparison of transformation tools based on the transformation tool contest publication-title: Sci. Comput. Program. – volume: 29 start-page: 615 year: 2019 end-page: 662 ident: br0080 article-title: Strategic port graph rewriting: an interactive modelling framework publication-title: Math. Struct. Comput. Sci. – volume: vol. 2505 start-page: 135 year: 2002 end-page: 147 ident: br0230 article-title: Relabelling in graph transformation publication-title: Proc. First International Conference on Graph Transformation (ICGT 2002) – volume: vol. 11176 start-page: 479 year: 2018 end-page: 494 ident: br0130 article-title: Verifying a copying garbage collector in GP publication-title: Software Technologies: Applications and Foundations – STAF 2018 Collocated Workshops, Revised Selected Papers – volume: 60–61 start-page: 17 year: 2004 end-page: 139 ident: br0320 article-title: A structural approach to operational semantics publication-title: J. Log. Algebraic Program. – volume: vol. 54 year: 2012 ident: br0170 article-title: Rooted graph programs publication-title: Proc. 7th International Workshop on Graph Based Tools (GraBaTs 2012) – volume: vol. 139 start-page: 16:1 year: 2019 end-page: 16:23 ident: br0210 article-title: Linear-time graph algorithms in GP publication-title: Proc. 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019) – volume: 60–61 start-page: 17 year: 2004 ident: 10.1016/j.scico.2021.102727_br0320 article-title: A structural approach to operational semantics publication-title: J. Log. Algebraic Program. – volume: vol. 10373 start-page: 196 year: 2017 ident: 10.1016/j.scico.2021.102727_br0070 article-title: Henshin: a usability-focused framework for EMF model transformation development – volume: vol. 8571 start-page: 33 year: 2014 ident: 10.1016/j.scico.2021.102727_br0120 article-title: Verifying monadic second-order properties of graph programs – volume: vol. 12741 start-page: 240 year: 2021 ident: 10.1016/j.scico.2021.102727_br0140 article-title: Verifying graph programs with monadic second-order logic – year: 2020 ident: 10.1016/j.scico.2021.102727_br0250 article-title: The Algorithm Design Manual doi: 10.1007/978-3-030-54256-6 – volume: vol. 1073 start-page: 454 year: 1996 ident: 10.1016/j.scico.2021.102727_br0260 article-title: Graph pattern matching in PROGRES – year: 2015 ident: 10.1016/j.scico.2021.102727_br0010 article-title: Graph and Model Transformation doi: 10.1007/978-3-662-47980-3 – volume: vol. 54 year: 2012 ident: 10.1016/j.scico.2021.102727_br0170 article-title: Rooted graph programs – year: 2020 ident: 10.1016/j.scico.2021.102727_br0200 – year: 2020 ident: 10.1016/j.scico.2021.102727_br0310 – volume: 14 start-page: 15 issue: 1 year: 2012 ident: 10.1016/j.scico.2021.102727_br0040 article-title: Modelling and analysis using GROOVE publication-title: Int. J. Softw. Tools Technol. Transf. doi: 10.1007/s10009-011-0186-x – year: 2015 ident: 10.1016/j.scico.2021.102727_br0220 – volume: vol. 10748 start-page: 92 year: 2018 ident: 10.1016/j.scico.2021.102727_br0150 article-title: Checking graph programs for confluence – year: 2020 ident: 10.1016/j.scico.2021.102727_br0300 article-title: A profiler for the matching process of Henshin – volume: vol. 9761 start-page: 102 year: 2016 ident: 10.1016/j.scico.2021.102727_br0180 article-title: Compiling graph programs to C – volume: vol. 330 start-page: 163 year: 2020 ident: 10.1016/j.scico.2021.102727_br0290 article-title: A fast graph program for computing minimum spanning trees – volume: 12 start-page: 263 issue: 3–4 year: 2010 ident: 10.1016/j.scico.2021.102727_br0060 article-title: GrGen.NET – the expressive, convenient and fast graph rewrite system publication-title: Int. J. Softw. Tools Technol. Transf. doi: 10.1007/s10009-010-0148-8 – volume: 118 start-page: 135 issue: 1–2 year: 2012 ident: 10.1016/j.scico.2021.102727_br0110 article-title: Hoare-style verification of graph programs publication-title: Fundam. Inform. doi: 10.3233/FI-2012-708 – volume: vol. 7233 start-page: 81 year: 2011 ident: 10.1016/j.scico.2021.102727_br0020 article-title: AGG 2.0 – new features for specifying and analyzing algebraic graph transformations – volume: 88 start-page: 154 year: 2017 ident: 10.1016/j.scico.2021.102727_br0100 article-title: From imperative to rule-based graph programs publication-title: J. Log. Algebraic Methods Program. doi: 10.1016/j.jlamp.2016.12.001 – year: 2019 ident: 10.1016/j.scico.2021.102727_br0270 – volume: vol. 82 start-page: 1 year: 2012 ident: 10.1016/j.scico.2021.102727_br0090 article-title: The design of GP2 – volume: vol. 2505 start-page: 135 year: 2002 ident: 10.1016/j.scico.2021.102727_br0230 article-title: Relabelling in graph transformation – volume: 85 start-page: 41 year: 2014 ident: 10.1016/j.scico.2021.102727_br0050 article-title: A survey and comparison of transformation tools based on the transformation tool contest publication-title: Sci. Comput. Program. doi: 10.1016/j.scico.2013.10.009 – volume: vol. 922 year: 1995 ident: 10.1016/j.scico.2021.102727_br0160 article-title: Efficient Graph Rewriting and Its Implementation – year: 2009 ident: 10.1016/j.scico.2021.102727_br0280 – year: 2002 ident: 10.1016/j.scico.2021.102727_br0190 – volume: 5 start-page: 261 issue: 3 year: 2006 ident: 10.1016/j.scico.2021.102727_br0030 article-title: The design of a language for model transformations publication-title: Softw. Syst. Model. doi: 10.1007/s10270-006-0027-7 – volume: 29 start-page: 615 issue: 5 year: 2019 ident: 10.1016/j.scico.2021.102727_br0080 article-title: Strategic port graph rewriting: an interactive modelling framework publication-title: Math. Struct. Comput. Sci. doi: 10.1017/S0960129518000270 – volume: vol. 11176 start-page: 479 year: 2018 ident: 10.1016/j.scico.2021.102727_br0130 article-title: Verifying a copying garbage collector in GP2 – year: 1974 ident: 10.1016/j.scico.2021.102727_br0240 – volume: vol. 139 start-page: 16:1 year: 2019 ident: 10.1016/j.scico.2021.102727_br0210 article-title: Linear-time graph algorithms in GP2 |
| SSID | ssj0006471 |
| Score | 2.3880634 |
| Snippet | •Rooted rules are essential for fast rule-based graph algorithms.•Cycle graphs, trees, binary DAGs can be recognised by graph reduction in linear... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 102727 |
| SubjectTerms | Depth-first search Graph reduction Graph transformation Linear-time algorithms Rooted graph programs |
| Title | Fast rule-based graph programs |
| URI | https://dx.doi.org/10.1016/j.scico.2021.102727 |
| Volume | 214 |
| WOSCitedRecordID | wos000720929000010&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: 1872-7964 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006471 issn: 0167-6423 databaseCode: AIEXJ dateStart: 20211213 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PS8MwFA46PXjxt_ibHrxpoU3SJjmqTFREBBV2K2mToKJ1bJ345_vSNHU6ERW8lNE2S5cv_fJe9t73ENozmDBFcxHiIo1CaqgIhRQ0NDSWQmGWUlWr61-wy0ve64mrpnDisC4nwMqSv76K_r9CDecAbJs6-wu42y-FE_AZQIcjwA7HHwF_IofV_mD0qEO7Qqn9WpLax2ENx41R_143keW2uIO_78mvaJ_-nnCJ1e0VeJ5K3z2PXI29o8HYXLsC1us7RoO-zPjuAjim0YdIjcm0F7cLCewKjotjJu2YkzMw1YWTJPfUil2C6ARNux2DB3DgYbqDk45jKyHBnErAJ_3ra9ub7QzHLtN3Gs1glghg4ZnDs27vvF14U-dft0_nRabqcL6Jrr42RMaMi5tFNN94BcGhQ3MJTelyGS34ihtBA9QK2rXgBu_gBjW4gQd3Fd2edG-OT8OmwkVYEMqrUMpEaRMTFRXKcC1yw6WISUp5kacSR1rmOhJYAfMaZSQ3RKfEvnWEGOs7kjXUKZ9LvY4CsAxzFpnEFCyhmhnBk0iDfRxhKcALiDcQ9j83Kxr5d1uF5DHzcX4PWT1GmR2jzI3RBjpoG_Wd-sn3t6d-HLPGgHOGWQbAf9dw868Nt9Dc-6zdRp1qMNI7aLZ4qe6Hg91mgrwBqBxoGQ |
| 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=Fast+rule-based+graph+programs&rft.jtitle=Science+of+computer+programming&rft.au=Campbell%2C+Graham&rft.au=Courtehoute%2C+Brian&rft.au=Plump%2C+Detlef&rft.date=2022-02-01&rft.pub=Elsevier+B.V&rft.issn=0167-6423&rft.eissn=1872-7964&rft.volume=214&rft_id=info:doi/10.1016%2Fj.scico.2021.102727&rft.externalDocID=S0167642321001209 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6423&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6423&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6423&client=summon |