Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2014
FLOWER: optimal test suite reduction as a network maximum flow
ISSTA 2014: Proceedings of the 2014 International Symposium on Software Testing and AnalysisPages 171–180https://doi.org/10.1145/2610384.2610416A trend in software testing is reducing the size of a test suite while preserving its overall quality. Given a test suite and a set of requirements covered by the suite, test suite reduction aims at selecting a subset of test cases that cover the same ...
- articleDecember 2012
New solutions for disjoint paths in P systems
Natural Computing: an international journal (NATC), Volume 11, Issue 4Pages 637–651https://doi.org/10.1007/s11047-012-9342-9We propose four fast synchronous distributed message-based algorithms, to identify maximum cardinality sets of edge- and node-disjoint paths, between a source node and a target node in a digraph. Previously, Dinneen et al. presented two algorithms, ...
- articleNovember 1982
A Class of Continuous Network Flow Problems
Mathematics of Operations Research (MOOR), Volume 7, Issue 4Pages 501–514https://doi.org/10.1287/moor.7.4.501<P>The solution in discrete time of the problem of maximizing the flow in a network with time-varying are capacities and storage at the nodes is a straightforward extension of the static case. In this paper the problem is formulated and solved in ...