pdf-format: |
|
@InProceedings{campbell_et_al:LIPIcs:2019:11444, author = {Graham Campbell and Brian Courtehoute and Detlef Plump}, title = {{Linear-Time Graph Algorithms in GP 2}}, booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)}, pages = {16:1--16:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-120-7}, ISSN = {1868-8969}, year = {2019}, volume = {139}, editor = {Markus Roggenbach and Ana Sokolova}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11444}, URN = {urn:nbn:de:0030-drops-114440}, doi = {10.4230/LIPIcs.CALCO.2019.16}, annote = {Keywords: Graph transformation, rooted graph programs, GP 2, linear-time algorithms, depth-first search, topological sorting} }
Keywords: | Graph transformation, rooted graph programs, GP 2, linear-time algorithms, depth-first search, topological sorting | |
Seminar: | 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019) | |
Issue date: | 2019 | |
Date of publication: | 25.11.2019 |