Sciweavers

1756 search results - page 63 / 352
» Directed scale-free graphs
Sort
View
PVLDB
2008
167views more  PVLDB 2008»
13 years 6 months ago
Keyword search on external memory data graphs
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
Bhavana Bharat Dalvi, Meghana Kshirsagar, S. Sudar...
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
11 years 10 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
EDBT
2010
ACM
138views Database» more  EDBT 2010»
14 years 22 days ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 7 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
CORR
2008
Springer
58views Education» more  CORR 2008»
13 years 8 months ago
Some results on (a:b)-choosability
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
Shai Gutner, Michael Tarsi