343 search results - page 12 / 69 » On Making Directed Graphs Transitive |
STOC
2007
ACM
16 years 4 hour ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
119
click to vote
AVI
2010
15 years 1 months ago
2010
As our ability to measure the world around us improves, we are quickly generating massive quantities of high-dimensional, spatial-temporal data. In this paper, we concern ourselve...
COSIT
2009
Springer
15 years 6 months ago
2009
Springer
Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph...
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
We study protocols to enable one user (the principal) to make potentially profitable but risky interactions with another user (the agent), in the absence of direct trust between ...
111
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...