Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
A fast and simple algorithm for designing time-optimal waveforms is presented. The algorithm accepts a given arbitrary multi-dimensional k-space trajectory as the input and outputs...
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
Min Chih Lin, Dieter Rautenbach, Francisco J. Soul...
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...