2125 search results - page 205 / 425 » On Graph Complexity |
115
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low th...
130
click to vote
COMCOM
2006
15 years 3 months ago
2006
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
137
click to vote
TCAD
2008
15 years 3 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
199
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
122
click to vote
RSA
2006
15 years 3 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...