Sciweavers

2463 search results - page 130 / 493
» Rankings of Directed Graphs
Sort
View
EDBT
2008
ACM
160views Database» more  EDBT 2008»
13 years 11 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu
PVLDB
2008
167views more  PVLDB 2008»
13 years 7 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...
EDBT
2010
ACM
138views Database» more  EDBT 2010»
14 years 2 months 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 9 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 9 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