Sciweavers

159 search results - page 19 / 32
» Undirected Graphs of Entanglement 2
Sort
View
COCOA
2011
Springer
12 years 6 months ago
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-B...
CISIM
2007
IEEE
14 years 1 months ago
A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a P...
Shichang Sun, Ajith Abraham, Guiyong Zhang, Hongbo...
ESA
2003
Springer
124views Algorithms» more  ESA 2003»
13 years 12 months ago
The Minimum Generalized Vertex Cover Problem
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
Refael Hassin, Asaf Levin
ICASSP
2011
IEEE
12 years 10 months ago
Downsampling graphs using spectral theory
In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In par...
Sunil K. Narang, Antonio Ortega
ECCC
2006
70views more  ECCC 2006»
13 years 6 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas