Multistage s-t Path: Confronting Similarity with Dissimilarity

by   Till Fluschnik, et al.

Addressing a quest by Gupta et al. [ICALP'14], we provide a first, comprehensive study of finding a short s-t path in the multistage graph model, referred to as the Multistage s-t Path problem. Herein, given a sequence of graphs over the same vertex set but changing edge sets, the task is to find short s-t paths in each graph ("snapshot") such that in the resulting path sequence the consecutive s-t paths are "similar". We measure similarity by the size of the symmetric difference of either the vertex set (vertex-similarity) or the edge set (edge-similarity) of any two consecutive paths. We prove that the two variants of Multistage s-t Path are already NP-hard for an input sequence of only two graphs. Motivated by this fact and natural applications of this scenario e.g. in traffic route planning, we perform a parameterized complexity analysis. Among other results, we prove parameterized hardness (W[1]-hardness) regarding the size of the path sequence (solution size) for both variants, vertex- and edge-similarity. As a novel conceptual contribution, we then modify the multistage model by asking for dissimilar consecutive paths. As one of the main results, we prove that dissimilarity allows for fixed-parameter tractability for the parameter solution size, thereby contrasting our W[1]-hardness proof of the corresponding similarity case.



There are no comments yet.


page 1

page 2

page 3

page 4


Reducing graph transversals via edge contractions

For a graph parameter π, the Contraction(π) problem consists in, given a...

An Interpretable Music Similarity Measure Based on Path Interestingness

We introduce a novel and interpretable path-based music similarity measu...

Finding Balance-Fair Short Paths in Graphs

The computation of short paths in graphs with edge lengths is a pillar o...

Approximating Multistage Matching Problems

In multistage perfect matching problems we are given a sequence of graph...

Structural Parameterizations of Tracking Paths Problem

Given a graph G with source and destination vertices s,t∈ V(G) respectiv...

The Almost-Disjoint 2-Path Decomposition Problem

We consider the problem of decomposing a given (di)graph into paths of l...

QCSP on Reflexive Tournaments

We give a complexity dichotomy for the Quantified Constraint Satisfactio...
This week in AI

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