Minimum Spanning Trees in Weakly Dynamic Graphs

04/10/2019
by   Moustafa Nakechbandi, et al.
0

In this paper, we study weakly dynamic undirected graphs, that can be used to represent some logistic networks. The goal is to deliver all the delivery points in the network. The network exists in a mostly stable environment, except for a few edges known to be non-stable. The weight of each of these non-stable edges may change at any time (bascule or lift bridge, elevator, traffic congestion...). All other edges have stable weights that never change. This problem can be now considered as a Minimum Spanning Tree (MST) problem on a dynamic graph. We propose an efficient polynomial algorithm that computes in advance alternative MSTs for all possible configurations. No additional computation is then needed after any change in the problem because the MSTs are already known in all cases. We use these results to compute critical values for the non-stable weights and to pre-compute best paths. When the non-stable weights change, the appropriate MST may then directly and immediately be used without any recomputation.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

01/23/2018

Stable gonality is computable

Stable gonality is a multigraph parameter that measures the complexity o...
05/11/2021

A Stronger Lower Bound on Parametric Minimum Spanning Trees

We prove that, for an undirected graph with n vertices and m edges, each...
05/27/2021

On the Complexity of Weight-Dynamic Network Algorithms

While operating communication networks adaptively may improve utilizatio...
04/09/2021

On the minimum spanning tree problem in imprecise set-up

In this article, we study the Euclidean minimum spanning tree problem in...
02/21/2018

Spanning Tree Congestion and Computation of Generalized Győri-Lovász Partition

We study a natural problem in graph sparsification, the Spanning Tree Co...
01/21/2020

Streaming Complexity of Spanning Tree Computation

The semi-streaming model is a variant of the streaming model frequently ...
07/15/2019

Noise-Stable Rigid Graphs for Euclidean Embedding

We proposed a new criterion noise-stability, which revised the classical...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.