ESA
2005
Springer
13 years 9 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 ...
ESA
2005
Springer
13 years 9 months ago
2005
Springer
ESA
2005
Springer
13 years 9 months ago
2005
Springer
ESA
2005
Springer
13 years 9 months ago
2005
Springer
ESA
2005
Springer
13 years 9 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
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
ESA
2005
Springer
13 years 9 months ago
2005
Springer
ESA
2005
Springer
13 years 9 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
2005
Springer
13 years 9 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
ESA
2005
Springer
13 years 9 months ago
2005
Springer