# Information Processing Letters

Information Processing Letters > 1995 > 53 > 1 > 27-31

^{1}.

Information Processing Letters > 1995 > 53 > 1 > 55-59

_{i}E an ordered pair of rational numbers (a

_{i}, b

_{i}). Let the weight of a spanning tree T, w(T), be defined as Σ

_{e}

_{i}

^{T}a

_{i}+

_{e}

_{i}

^{T}b

_{i}. A spanning tree T in G is called a w-optimum spanning tree if w(T) w(T ) for all spanning trees T in G. The function...

Information Processing Letters > 1995 > 53 > 1 > 37-47

_{1}, x

_{2}, ,x

_{N}where a non-negative weight w

_{i}is assigned to each element x

_{i}for all i so that Σ

^{N}

_{i}

_{=}

_{1}w

_{i}= W. The algorithm has a time complexity of O((NW) ...

Information Processing Letters > 1995 > 53 > 1 > 11-16

Information Processing Letters > 1995 > 53 > 1 > 5-9

Information Processing Letters > 1995 > 53 > 1 > 1-4

Information Processing Letters > 1995 > 53 > 1 > 49-54

Information Processing Letters > 1995 > 53 > 1 > 17-25

Information Processing Letters > 1995 > 53 > 2 > 85-89

^{2}) where n is the number of time intervals being stored. As a result, high disk I/O overhead is experienced in various operations such as the insertion and deletion of a time interval (O(n)) and the interval intersection...

Information Processing Letters > 1995 > 53 > 2 > 61-68

Information Processing Letters > 1995 > 53 > 2 > 69-75

Information Processing Letters > 1995 > 53 > 2 > 109-111

Information Processing Letters > 1995 > 53 > 2 > 91-96

Information Processing Letters > 1995 > 53 > 2 > 113-119

Information Processing Letters > 1995 > 53 > 2 > 77-83

Information Processing Letters > 1995 > 53 > 2 > 97-101

Information Processing Letters > 1995 > 53 > 2 > 103-107

Information Processing Letters > 1995 > 53 > 3 > 159-163