343 search results - page 20 / 69 » On Making Directed Graphs Transitive |
108
click to vote
ISSTA
2004
ACM
15 years 7 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...
119
Voted
APN
2006
Springer
15 years 5 months ago
2006
Springer
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
87
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
151
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
Localizing objects in images is a difficult task and represents the first step to the solution of the object recognition problem. This paper presents a novel approach to the local...
119
Voted
CSB
2005
IEEE
15 years 7 months ago
2005
IEEE
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...