196 search results - page 39 / 40 » Connected Coloring Completion for General Graphs: Algorithms... |
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
GECCO
2009
Springer
14 years 25 days ago
2009
Springer
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
SIAMDM
1998
13 years 6 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
PODS
2002
ACM
14 years 6 months ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...