Sciweavers

803 search results - page 125 / 161
» Independence in Direct-Product Graphs
Sort
View
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
14 years 3 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
IJSI
2008
91views more  IJSI 2008»
13 years 8 months ago
Random Event Structures
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Manfred Droste, Guo-Qiang Zhang
BMCBI
2005
156views more  BMCBI 2005»
13 years 8 months ago
A new dynamical layout algorithm for complex biochemical reaction networks
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
Katja Wegner, Ursula Kummer
RE
2010
Springer
13 years 3 months ago
Risk-based Confidentiality Requirements Specification for Outsourced IT Systems
Today, companies are required to be in control of their IT assets, and to provide proof of this in the form of independent IT audit reports. However, many companies have outsourced...
Ayse Morali, Roel Wieringa
INFOCOM
2005
IEEE
14 years 2 months ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic