204 search results - page 6 / 41 » Testing Triangle-Freeness in General Graphs |
ISSTA
2004
ACM
15 years 5 months ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
112
click to vote
FCT
1993
Springer
15 years 3 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
WWW
2007
ACM
16 years 11 days ago
2007
ACM
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...