Shortest non-separating st-path on chordal graphs

01/10/2021
by   Xiao Mao, et al.
0

Many NP-Hard problems on general graphs, such as maximum independence set, maximal cliques and graph coloring can be solved efficiently on chordal graphs. In this paper, we explore the problem of non-separating st-paths defined on edges: for a connected undirected graph and two vertices, a non-separating path is a path between the two vertices such that if we remove all the edges on the path, the graph remains connected. We show that on general graphs, checking the existence of non-separating st-paths is NP-Hard, but the same problem can be solved in linear time on chordal graphs. In the case that such path exists, we introduce an algorithm that finds the shortest non-separating st-path on a connected chordal graph of n vertices and m edges with positive edge lengths that runs in O(nlogn + m) time.

READ FULL TEXT
research
02/20/2022

Finding shortest non-separating and non-disconnecting paths

For a connected graph G = (V, E) and s, t ∈ V, a non-separating s-t path...
research
11/30/2018

The inverse Voronoi problem in graphs

We introduce the inverse Voronoi diagram problem in graphs: given a grap...
research
04/24/2018

A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths

We study the NP-hard Shortest Path Most Vital Edges problem arising in t...
research
11/15/2022

A Heuristic Subexponential Algorithm to Find Paths in Markoff Graphs Over Finite Fields

Charles, Goren, and Lauter [J. Cryptology 22(1), 2009] explained how one...
research
05/01/2019

Reconfiguring Undirected Paths

We consider problems in which a simple path of fixed length, in an undir...
research
06/20/2023

Increasing paths in random temporal graphs

We consider random temporal graphs, a version of the classical Erdős–Rén...
research
02/11/2022

The complexity of computing optimum labelings for temporal connectivity

A graph is temporally connected if there exists a strict temporal path, ...

Please sign up or login with your details

Forgot password? Click here to reset