225 search results - page 28 / 45 » From polynomial time queries to graph structure theory |
66
Voted
WWW
2007
ACM
15 years 10 months ago
2007
ACM
![Finding community structure in mega-scale social networks: [extended abstract]](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Finding community structure in mega-scale social networks: [extended abstract]")
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Complex systems exhibit emergent patterns of behavior at different levels of organization. Powerful network analysis methods, developed in physics and social sciences, have been s...
88
Voted
EDBT
2004
ACM
15 years 9 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
102
Voted
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
BMCBI
2006
14 years 9 months ago
2006
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...