Sciweavers

96 search results - page 3 / 20
» Path Hitting in Acyclic Graphs
Sort
View
TON
2012
11 years 8 months ago
Independent Directed Acyclic Graphs for Resilient Multipath Routing
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
Sangman Cho, Theodore Elhourani, Srinivasan Ramasu...
IPL
2006
95views more  IPL 2006»
13 years 5 months ago
Smaller superconcentrators of density 28
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...
Uwe Schöning
DBSEC
2010
196views Database» more  DBSEC 2010»
13 years 2 months ago
Preserving Integrity and Confidentiality of a Directed Acyclic Graph Model of Provenance
Abstract. This paper describes how to preserve integrity and confidentiality of a directed acyclic graph (DAG) model of provenance database. We show a method to preserve integrity ...
Amril Syalim, Takashi Nishide, Kouichi Sakurai
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
12 years 5 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
ICNP
2000
IEEE
13 years 10 months ago
Convergent Multi-Path Routing
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
Jorge Arturo Cobb