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

Celý popis

Podrobná bibliografie

Vydáno v:	Science of computer programming Ročník 214; s. 102727
Hlavní autoři:	Campbell, Graham, Courtehoute, Brian, Plump, Detlef
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.02.2022
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!