Sciweavers

4865 search results - page 290 / 973
» The Complexity of Graph Connectivity
Sort
View
NN
2006
Springer
104views Neural Networks» more  NN 2006»
15 years 6 months ago
Local multidimensional scaling
Several bioinformatics data sets are naturally represented as graphs, for instance gene regulation, metabolic pathways, and proteinprotein interactions. The graphs are often large ...
Jarkko Venna, Samuel Kaski
AMW
2011
14 years 10 months ago
SNQL: A Social Networks Query and Transformation Language
Abstract. Social Network (SN) data has become ubiquitous, demanding advanced and flexible means to represent, transform and query such data. In addition to the intrinsic challenge...
Mauro San Martín, Claudio Gutierrez, Peter ...
CSE
2009
IEEE
16 years 1 months ago
Structure of Neighborhoods in a Large Social Network
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
Alina Stoica, Christophe Prieur
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
16 years 21 days ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
147
Voted
DAM
2008
82views more  DAM 2008»
15 years 6 months ago
Closest 4-leaf power is fixed-parameter tractable
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...