Sciweavers

Share
ESA
2005
Springer
155views Algorithms» more  ESA 2005»
9 years 9 months ago
A Loopless Gray Code for Minimal Signed-Binary Representations
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 ...
Gurmeet Singh Manku, Joe Sawada
ESA
2005
Springer
99views Algorithms» more  ESA 2005»
9 years 9 months ago
An Experimental Study of Algorithms for Fully Dynamic Transitive Closure
Ioannis Krommidas, Christos D. Zaroliagis
ESA
2005
Springer
104views Algorithms» more  ESA 2005»
9 years 9 months ago
Generating Realistic Terrains with Higher-Order Delaunay Triangulations
Thierry de Kok, Marc J. van Kreveld, Maarten L&oum...
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
9 years 9 months ago
On Degree Constrained Shortest Paths
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...
Samir Khuller, Kwangil Lee, Mark A. Shayman
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
9 years 9 months ago
Optimal Integer Alphabetic Trees in Linear Time
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 ...
T. C. Hu, Lawrence L. Larmore, J. David Morgenthal...
ESA
2005
Springer
88views Algorithms» more  ESA 2005»
9 years 9 months ago
Engineering Planar Separator Algorithms
Martin Holzer, Grigorios Prasinos, Frank Schulz, D...
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
9 years 9 months ago
Minimal Interval Completions
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 ...
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve...
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
9 years 9 months ago
Unbalanced Graph Cuts
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...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
ESA
2005
Springer
84views Algorithms» more  ESA 2005»
9 years 9 months ago
Jitter Regulation for Multiple Streams
David Hay, Gabriel Scalosub
books