343 search results - page 4 / 69 » On Making Directed Graphs Transitive |
134
click to vote
DM
1999
15 years 2 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
119
click to vote
CSCLP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
96
Voted
EURODAC
1994
IEEE
15 years 7 months ago
1994
IEEE
This paper introduces a new Generalized Signal Transition Graph model for specifying complex mixed asynchronous/synchronouscircuits, as found in system-level interfaces. Our goal h...
131
Voted
PROPERTYTESTING
2010
15 years 23 days ago
2010
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...
115
click to vote
AIPS
2006
15 years 4 months ago
2006
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...