Calculating path algorithms
type: Item
instance of: scholarly article
title: Calculating path algorithms
zbMATH Open document ID: 0818.68117
DOI: 10.1016/0167-6423(94)90005-1
author: Roland C. Backhouse
author: J. P. H. W. van den Eijnde
author: A. J. M. van Gasteren
published in: Science of Computer Programming
publication date: 1994-07-21T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 609577
zbMATH Keywords: path algorithms
zbMATH Keywords: algebra of regular languages
MaRDI profile type: Publication
full work available at URL: 0167-6423(94)90005-1
OpenAlex ID: W2054262476
Recommended article: Q4281661
Recommended article: Q3692866
Recommended article: Algorithms to count paths and cycles
Recommended article: Path Algorithms on Regular Graphs
Recommended article: Q5294048
Recommended article: Q3710540
Recommended article: Algorithms for long paths in graphs
Recommended article: Calculating Graph Algorithms for Dominance and Shortest Path
Recommended article: Computing almost shortest paths
description: scientific article; zbMATH DE number 609577