2612 search results - page 413 / 523 » Switching Graphs and Their Complexity |
127
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
134
click to vote
RECOMB
2006
Springer
16 years 3 months ago
2006
Springer
Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functio...
142
click to vote
RECOMB
2006
Springer
16 years 3 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 ...
129
click to vote
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
174
click to vote
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...