JAL
2006
13 years 11 months ago
2006
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
JAL
2006
13 years 11 months ago
2006
JAL
2006
13 years 11 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
JAL
2006
13 years 11 months ago
2006
JAL
2006
13 years 11 months ago
2006
Egecioglu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K-1 in terms of special rim-hook tableaux. They were able to use this interpretation to...
JAL
2006
13 years 11 months ago
2006
JAL
2006
13 years 11 months ago
2006
JAL
2006
13 years 11 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
JAL
2006
13 years 11 months ago
2006
JAL
2006
13 years 11 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...