Abstract. Let G=(V,E) be a 2-edge connected, undirected and nonnegatively weighted graph, and let S(r) be a single source shortest paths tree (SPT) of G rooted at r âˆˆ V . Whenever an edge e in S(r)â€¦ (More)

In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in G. The removal of aâ€¦ (More)

Let PG(r, s) denote a shortest path between two nodes r and s in an undirected graph G = (V ,E) such that|V | = n and |E| = m and with a positive real length w(e) associated with any e âˆˆ E. In thisâ€¦ (More)

We propose a new image retrieval method based on human perceptual clustering of color images. This color clustering produces for each image a small set of representative colors which captures theâ€¦ (More)

In network communication systems, frequently messages are routed along a minimum diameter spanning tree (MDST) of the network, to minimize the maximum delay in delivering a message. When a transientâ€¦ (More)

Given an instance of an optimization problem together with an optimal solution, we consider the scenario in which this instance is modified locally. In graph problems, e. g., a singular edge might beâ€¦ (More)

In this paper we investigate the problem of finding a 2-connected spanning subgraph of minimal cost in a complete and weighted graph G. This problem is known to be APX-hard, for both the edge and theâ€¦ (More)