45 search results - page 8 / 9 » Small Maximal Matchings in Random Graphs |
RECOMB
2006
Springer
14 years 7 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
TPDS
2010
13 years 5 months ago
2010
—In an n-way broadcast application, each one of n overlay nodes wants to push its own distinct large data file to all other n À 1 destinations as well as download their respecti...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
WDAG
2009
Springer
14 years 2 days ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
BMCBI
2008
13 years 7 months ago
2008
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...