1097 search results - page 63 / 220 » Testing Graph Isomorphism |
ICECCS
1997
IEEE
15 years 2 months ago
1997
IEEE
Software architectures can play a role in improving the testing process of complex systems. In particular, descriptions of the software architecture can be useful to drive integra...
101
click to vote
APPROX
2011
Springer
13 years 10 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
143
click to vote
FASE
2012
Springer
13 years 5 months ago
2012
Springer
Software product lines are families of products defined by feature commonality and variability, with a well-managed asset base. Recent work in testing of software product lines ha...
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
ALGORITHMICA
2010
14 years 10 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...