IPL
2008
13 years 4 months ago
2008
IPL
2008
13 years 4 months ago
2008
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E F we say that H is a proper interval completion of G. The graph H is called a minimal proper inte...
IPL
2008
13 years 4 months ago
2008
IPL
2008
13 years 4 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
IPL
2008
13 years 4 months ago
2008
Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these resul...
IPL
2008
13 years 4 months ago
2008
We show that deciding if a mixed graph has a well-balanced orientation is NP-complete.
IPL
2008
13 years 4 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
IPL
2008
13 years 4 months ago
2008
In order to generate a universal probability distribution to extrapolate a binary string x of length i, we feed random bits into a universal device, M. When we find an input strin...
IPL
2008
13 years 4 months ago
2008
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...