Impossible pair constrained test path generation in a program

DOI10.1016/0020-0255(82)90019-6MaRDI QIDQ1838316zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• Methodology for the Generation of Program Test Data
• On structured digraphs and program testing
• Revised Matrix Algorithms for Shortest Paths

Cited in

(8)

• 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
• Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics
• Shortest paths with exclusive-disjunction arc pairs conflicts
• An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints
• The checkpoint problem
• On the complexity of paths avoiding forbidden pairs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838316)