On legal path problems in digraphs
type: Item
instance of: scholarly article
title: On legal path problems in digraphs
zbMATH Open document ID: 0534.68047
DOI: 10.1016/0020-0190(84)90030-9
author: Heung-Soon Ihm
author: Simeon C. Ntafos
published in: Information Processing Letters
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68N99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 3848626
zbMATH Keywords: program testing
zbMATH Keywords: impossible path, legal path
zbMATH Keywords: NP-completeness
zbMATH Keywords: efficient algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(84)90030-9
OpenAlex ID: W2094658183
cites work: Q4773298
cites work: `` Strong '' NP-Completeness Results
cites work: On Path Cover Problems in Digraphs and Applications to Program Testing
cites work: Q3901003
cites work: A Unified Approach to Path Problems
description: scientific article; zbMATH DE number 3848626