Sciweavers

398 search results - page 41 / 80
» Critical exponents of graphs
Sort
View
ICDCS
2008
IEEE
15 years 5 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
FOCS
2008
IEEE
15 years 5 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 1 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
BMCBI
2004
121views more  BMCBI 2004»
14 years 10 months ago
DEDB: a database of Drosophila melanogaster exons in splicing graph form
Background: A wealth of quality genomic and mRNA/EST sequences in recent years has provided the data required for large-scale genome-wide analysis of alternative splicing. We have...
Bernett T. K. Lee, Tin Wee Tan, Shoba Ranganathan
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 3 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu