Sciweavers

730 search results - page 55 / 146
» Combinatorics of Monotone Computations
Sort
View
COCOON
1999
Springer
15 years 11 months ago
On Routing in Circulant Graphs
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
CPM
2009
Springer
131views Combinatorics» more  CPM 2009»
15 years 10 months ago
Linear Time Suffix Array Construction Using D-Critical Substrings
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
Ge Nong, Sen Zhang, Wai Hong Chan
COCOON
2008
Springer
15 years 8 months ago
Optimal Insertion of a Segment Highway in a City Metric
Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (w...
Matias Korman, Takeshi Tokuyama
COCOON
2008
Springer
15 years 8 months ago
On the Complexity of Equilibria Problems in Angel-Daemon Games
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
Joaquim Gabarró, Alina García, Maria...
ISSAC
2009
Springer
172views Mathematics» more  ISSAC 2009»
16 years 1 months ago
Liouvillian solutions of irreducible linear difference equations
In this paper we give a new algorithm to compute Liouvillian solutions of linear difference equations. Compared to the prior algorithm by Hendriks and Singer, our main contributi...
Yongjae Cha, Mark van Hoeij