On legal path problems in digraphs

DOI10.1016/0020-0190(84)90030-9zbMath0534.68047OpenAlexW2094658183MaRDI QIDQ790621

Heung-Soon Ihm, Simeon C. Ntafos

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90030-9

zbMATH Keywords

NP-completenessefficient algorithmprogram testingimpossible path, legal path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Theory of software (68N99)

Cites Work

• Unnamed Item
• Unnamed Item
• A Unified Approach to Path Problems
• `` Strong NP-Completeness Results
• On Path Cover Problems in Digraphs and Applications to Program Testing

This page was built for publication: On legal path problems in digraphs