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...

Full description

Bibliographic Details

Published in:	Science of computer programming Vol. 214; p. 102727
Main Authors:	Campbell, Graham, Courtehoute, Brian, Plump, Detlef
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2022
Subjects:	Depth-first search Graph reduction Graph transformation Linear-time algorithms Rooted graph programs Graph reduction Graph transformation Rooted graph programs Linear-time algorithms Depth-first search
ISSN:	0167-6423, 1872-7964
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!