1127 search results - page 41 / 226 » Testing the Expansion of a Graph |
APPROX
2011
Springer
12 years 11 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...
FASE
2012
Springer
12 years 6 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
14 years 2 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
13 years 11 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...
SIGSOFT
2007
ACM
14 years 11 months ago
2007
ACM
Because of the growing complexity of wireless sensor network applications (WSNs), traditional software development tools are being developed that are specifically designed for the...