Sciweavers

2304 search results - page 50 / 461
» On the Vulnerability of Large Graphs
Sort
View
TKDD
2011
35views more  TKDD 2011»
14 years 6 months ago
HADI: Mining Radii of Large Graphs
U. Kang, Charalampos E. Tsourakakis, Ana Paula App...
81
Voted
SIGMOD
2012
ACM
300views Database» more  SIGMOD 2012»
13 years 2 months ago
OPAvion: mining and visualization in large graphs
Leman Akoglu, Duen Horng Chau, U. Kang, Danai Kout...
SIGMOD
2012
ACM
236views Database» more  SIGMOD 2012»
13 years 2 months ago
Towards effective partition management for large graphs
Shengqi Yang, Xifeng Yan, Bo Zong, Arijit Khan
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
15 years 6 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...
JGT
2006
97views more  JGT 2006»
14 years 11 months ago
Matchings in hypergraphs of large minimum degree
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
Daniela Kühn, Deryk Osthus