Learn More
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphismproblem), which can be solved in polynomialtime for distance-hereditary graphs, are NP-complete or open for parity graphs. Moreover, the metric characterizations of these two graph classes suggest an excessive gap between them. We introduce a family of classes(More)
We propose a fully-dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights. If ∆ σ is the number of pairs of nodes changing the distance after a single edge modification σ (insert, delete, weight decrease, or weight increase) then the message complexity of the proposed algorithm is O(n∆ σ)(More)
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and other combinatorial problems exploit the structural property of these graphs described by Burlet and Uhry in 8]. This paper introduces a diierent structural property of parity graphs:(More)
Several attempts have been done in the literature in the last years in order to provide a formal definition of the notions of robustness and recoverability for optimization problems. Recently, a new model of recoverable robustness has been introduced in the context of railways optimization. The basic idea of recoverable robustness is to compute solutions(More)
In this paper we provide efficient robust algorithms for shunting problems concerning the reordering of train cars over a hump. In particular , we study algorithms able to cope with small disruptions, as temporary and local unavailability and/or malfunctioning of key resources that can occur and affect planned operations. To this aim, a definition of robust(More)