<bibliography>
 <citation type="article" key="Agrawal-Karsai-Neema-Shi-Vizhanyo06a">
  <author>Aditya <surname>Agrawal</surname></author>
  <author>Gabor <surname>Karsai</surname></author>
  <author>Sandeep <surname>Neema</surname></author>
  <author>Feng <surname>Shi</surname></author>
  <author>Attila <surname>Vizhanyo</surname></author>
  <year>2006</year>
  <title>The design of a language for model transformations</title>
  <journal>Software and System Modeling</journal>
  <volume>5</volume>
  <number>3</number>
  <pages>261&#8211;288</pages>
  <doi>10.1007/s10270-006-0027-7</doi>
 </citation>
 <citation type="inproceedings" key="Arendt-Biermann-Jurack-Krause-Taentzer10a">
  <author>Thorsten <surname>Arendt</surname></author>
  <author>Enrico <surname>Biermann</surname></author>
  <author>Stefan <surname>Jurack</surname></author>
  <author>Christian <surname>Krause</surname></author>
  <author>Gabriele <surname>Taentzer</surname></author>
  <year>2010</year>
  <title>Henshin: Advanced Concepts and Tools for In-Place EMF Model Transformations</title>
  <booktitle>Model Driven Engineering Languages and Systems (MODELS 2010)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>6394</volume>
  <publisher>Springer</publisher>
  <pages>121&#8211;135</pages>
  <doi>10.1007/978-3-642-16145-2_9</doi>
 </citation>
 <citation type="phdthesis" key="Bak15a">
  <author>Christopher <surname>Bak</surname></author>
  <year>2015</year>
  <title>GP+.1667em2: Efficient Implementation of a Graph Programming Language</title>
  <school>Department of Computer Science, University of York</school>
  <url>http://etheses.whiterose.ac.uk/12586/</url>
 </citation>
 <citation type="inproceedings" key="Bak-Plump12a">
  <author>Christopher <surname>Bak</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2012</year>
  <title>Rooted Graph Programs</title>
  <booktitle>Proc. International Workshop on Graph Based Tools (GraBaTs 2012)</booktitle>
  <series>Electronic Communications of the EASST</series>
  <volume>54</volume>
  <doi>10.14279/tuj.eceasst.54.780</doi>
 </citation>
 <citation type="inproceedings" key="Bak-Plump16a">
  <author>Christopher <surname>Bak</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2016</year>
  <title>Compiling Graph Programs to C</title>
  <booktitle>Proc. International Conference on Graph Transformation (ICGT 2016)</booktitle>
  <series>LNCS</series>
  <volume>9761</volume>
  <publisher>Springer</publisher>
  <pages>102&#8211;117</pages>
  <doi>10.1007/978-3-319-40530-8_7</doi>
 </citation>
 <citation type="article" key="Cunyet-Khali-2001">
  <author>C&#252;neyt F. <surname>Bazlama&#x00e7;c&#305;</surname></author>
  <author>Khalil S. <surname>Hindi</surname></author>
  <year>2001</year>
  <title>Minimum-weight spanning tree algorithms A survey and empirical study</title>
  <journal>Computers &#38; Operations Research</journal>
  <volume>28</volume>
  <number>8</number>
  <pages>767&#8211;785</pages>
  <doi>10.1016/S0305-0548(00)00007-1</doi>
 </citation>
 <citation type="unpublished" key="CampbellCourtehoutePlump20">
  <author>Graham <surname>Campbell</surname></author>
  <author>Brian <surname>Courtehoute</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <title>Fast Rule-Based Graph Programs</title>
  <note>Work in progress</note>
 </citation>
 <citation type="inproceedings" key="Campbell-Courtehoute-Plump-2019">
  <author>Graham <surname>Campbell</surname></author>
  <author>Brian <surname>Courtehoute</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2019</year>
  <title>Linear-Time Graph Algorithms in GP+.1667em2</title>
  <booktitle>Proceedings 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)</booktitle>
  <series>Leibniz International Proceedings in Informatics (LIPICS)</series>
  <publisher>Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik</publisher>
  <pages>16:1&#8211;16:23</pages>
  <doi>10.4230/LIPIcs.CALCO.2019.16</doi>
 </citation>
 <citation type="article" key="CampbellRomoPlump20">
  <author>Graham <surname>Campbell</surname></author>
  <author>Jack <surname>Rom&#246;</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2020</year>
  <title>The Improved GP+.1667em2 Compiler</title>
  <journal>ArXiv e-prints</journal>
  <volume>arXiv:2010.03993</volume>
  <url>https://arxiv.org/abs/2010.03993</url>
  <note>11 pages</note>
 </citation>
 <citation type="inproceedings" key="Courtehoute-Plump-2020">
  <author>Brian <surname>Courtehoute</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2020</year>
  <title>A Fast Graph Program for Computing Minimum Spanning Trees</title>
  <booktitle>Proc. 11th International Workshop on Graph Computation Models (GCM 2020)</booktitle>
  <pages>165&#8211;183</pages>
  <url>http://www.cs.york.ac.uk/plasma/publications/pdf/Courtehoute-Plump.GCM.20.pdf</url>
  <note>Pre-proceedings version of this paper</note>
 </citation>
 <citation type="inproceedings" key="Fernandez-Kirchner-Mackie-Pinaud14a">
  <author>Maribel <surname>Fern&#225;ndez</surname></author>
  <author>H&#233;l&#232;ne <surname>Kirchner</surname></author>
  <author>Ian <surname>Mackie</surname></author>
  <author>Bruno <surname>Pinaud</surname></author>
  <year>2014</year>
  <title>Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY</title>
  <booktitle>Proc. Computability in Europe (CiE 2014)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>8493</volume>
  <publisher>Springer</publisher>
  <pages>183&#8211;193</pages>
  <doi>10.1007/978-3-319-08019-2_19</doi>
 </citation>
 <citation type="article" key="Ghamarian-deMol-Rensink-Zambon-Zimakova12a">
  <author>Amir Hossein <surname>Ghamarian</surname></author>
  <author>Maarten <surname>de Mol</surname></author>
  <author>Arend <surname>Rensink</surname></author>
  <author>Eduardo <surname>Zambon</surname></author>
  <author>Maria <surname>Zimakova</surname></author>
  <year>2012</year>
  <title>Modelling and analysis using GROOVE</title>
  <journal>International Journal on Software Tools for Technology Transfer</journal>
  <volume>14</volume>
  <number>1</number>
  <pages>15&#8211;40</pages>
  <doi>10.1007/s10009-011-0186-x</doi>
 </citation>
 <citation type="inproceedings" key="Habel-Plump02c">
  <author>Annegret <surname>Habel</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2002</year>
  <title>Relabelling in Graph Transformation</title>
  <booktitle>Proc. International Conference on Graph Transformation (ICGT 2002)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>2505</volume>
  <publisher>Springer</publisher>
  <pages>135&#8211;147</pages>
  <doi>10.1007/3-540-45832-8_12</doi>
 </citation>
 <citation type="article" key="Jakumeit-Buchwald-Kroll10a">
  <author>Edgar <surname>Jakumeit</surname></author>
  <author>Sebastian <surname>Buchwald</surname></author>
  <author>Moritz <surname>Kroll</surname></author>
  <year>2010</year>
  <title>GrGen.NET - The expressive, convenient and fast graph rewrite system</title>
  <journal>International Journal on Software Tools for Technology Transfer</journal>
  <volume>12</volume>
  <number>3&#8211;4</number>
  <pages>263&#8211;271</pages>
  <doi>10.1007/s10009-010-0148-8</doi>
 </citation>
 <citation type="inproceedings" key="Plump12a">
  <author>Detlef <surname>Plump</surname></author>
  <year>2012</year>
  <title>The Design of GP+.1667em2</title>
  <booktitle>Proc. Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011)</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>82</volume>
  <pages>1&#8211;16</pages>
  <doi>10.4204/EPTCS.82.1</doi>
 </citation>
 <citation type="article" key="Plump17a">
  <author>Detlef <surname>Plump</surname></author>
  <year>2017</year>
  <title>From Imperative to Rule-based Graph Programs</title>
  <journal>Journal of Logical and Algebraic Methods in Programming</journal>
  <volume>88</volume>
  <pages>154&#8211;173</pages>
  <doi>10.1016/j.jlamp.2016.12.001</doi>
 </citation>
 <citation type="inproceedings" key="Runge-Ermel-Taentzer11a">
  <author>Olga <surname>Runge</surname></author>
  <author>Claudia <surname>Ermel</surname></author>
  <author>Gabriele <surname>Taentzer</surname></author>
  <year>2012</year>
  <title>AGG 2.0 &#8212; New Features for Specifying and Analyzing Algebraic Graph Transformations</title>
  <booktitle>Proc. Applications of Graph Transformations with Industrial Relevance (AGTIVE 2011)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>7233</volume>
  <publisher>Springer</publisher>
  <pages>81&#8211;88</pages>
  <doi>10.1007/978-3-642-34176-2_8</doi>
 </citation>
 <citation type="book" key="Sedgewick-1997">
  <author>Robert <surname>Sedgewick</surname></author>
  <year>1997</year>
  <title>Algorithms in C: Parts 1-4, Fundamentals, Data Structures, Sorting, and Searching</title>
  <edition>3rd</edition>
  <publisher>Addison-Wesley</publisher>
 </citation>
 <citation type="book" key="Sedgewick-2001">
  <author>Robert <surname>Sedgewick</surname></author>
  <year>2001</year>
  <title>Algorithms in C, Part 5: Graph Algorithms</title>
  <edition>3rd</edition>
  <publisher>Addison-Wesley</publisher>
 </citation>
 <citation type="book" key="Skiena-2008">
  <author>Steven S. <surname>Skiena</surname></author>
  <year>2008</year>
  <title>The Algorithm Design Manual</title>
  <edition>2nd</edition>
  <publisher>Springer</publisher>
  <doi>10.1007/978-1-84800-070-4</doi>
 </citation>
 <citation type="inproceedings" key="Wulandari-Plump-2020">
  <author>Gia <surname>Wulandari</surname></author>
  <author>Detlef <surname>Plump</surname></author>
  <year>2020</year>
  <title>Verifying Graph Programs with First-Order Logic</title>
  <booktitle>Graph Computation Models (GCM 2020), Revised Selected Papers</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>This volume</volume>
 </citation>
</bibliography>
