Login / Signup

A Bipartite Graph Approach to Generate Optimal Test Sequences for Protocol Conformance Testing using the Wp-method.

Jun WangJitian XiaoChiou Peng LamHuaizhong Li
Published in: APSEC (2005)
Keyphrases
  • np hard
  • greedy heuristic
  • computational complexity
  • test sequences
  • bipartite graph
  • dynamic programming
  • pairwise
  • data sets
  • reinforcement learning
  • test cases