Sciweavers

2125 search results - page 326 / 425
» On Graph Complexity
Sort
View
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 11 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
ICALP
2007
Springer
14 years 4 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
BMCBI
2007
202views more  BMCBI 2007»
13 years 10 months ago
ProtNet: a tool for stochastic simulations of protein interaction networks dynamics
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
Massimo Bernaschi, Filippo Castiglione, Alessandra...
BMCBI
2005
91views more  BMCBI 2005»
13 years 10 months ago
Providing visualisation support for the analysis of anatomy ontology data
Background: Improvements in technology have been accompanied by the generation of large amounts of complex data. This same technology must be harnessed effectively if the knowledg...
Aba-Sah Dadzie, Albert Burger
P2P
2005
IEEE
137views Communications» more  P2P 2005»
14 years 3 months ago
The Essence of P2P: A Reference Architecture for Overlay Networks
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have r...
Karl Aberer, Luc Onana Alima, Ali Ghodsi, Sarunas ...