Sciweavers

3 search results - page 1 / 1
» Smaller superconcentrators of density 28
Sort
View
IPL
2006
95views more  IPL 2006»
13 years 4 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
SODA
2003
ACM
81views Algorithms» more  SODA 2003»
13 years 6 months ago
Smaller explicit superconcentrators
d Abstract) N. Alon ∗ M. Capalbo † July 28, 2002 Using a new recursive technique, we present an explicit construction of an infinite family of N-superconcentrators of density...
Noga Alon, Michael R. Capalbo
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 5 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry