Impossible pair constrained test path generation in a program

DOI10.1016/0020-0255(82)90019-6zbMath0509.68062OpenAlexW1989204398MaRDI QIDQ1838316

Pradip K. Srimani, Bhabani P. Sinha

Publication date: 1982

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(82)90019-6

zbMATH Keywords

algorithmimpossible pair constrained path in a programprogram digraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) General topics in the theory of software (68N01)

Related Items (7)

Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics ⋮ Shortest paths with exclusive-disjunction arc pairs conflicts ⋮ Complexity of the path avoiding forbidden pairs problem revisited ⋮ On finding the longest antisymmetric path in directed acyclic graphs ⋮ Peptide sequencing via graph path decomposition ⋮ On the complexity of paths avoiding forbidden pairs ⋮ The checkpoint problem

Cites Work

• On structured digraphs and program testing
• Methodology for the Generation of Program Test Data
• Revised Matrix Algorithms for Shortest Paths
• Unnamed Item

This page was built for publication: Impossible pair constrained test path generation in a program