ESA
15 years 2 months ago
2005 Springer 
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
ESA
15 years 2 months ago
2005 Springer 
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
ESA
15 years 2 months ago
2005 Springer 
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signiļ¬...
72
Voted
ESA
15 years 2 months ago
2005 Springer
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and ļ¬nding the most frequent element (th...
ESA
15 years 2 months ago
2005 Springer
A string . . . a2a1a0 over the alphabet {ā1, 0, 1} is said to be a minimal signed-binary representation of an integer n if n = Ā kā„0 ak2k and the number of non-zero digits is ...
|
Algorithms