research
∙
10/24/2022
Non-Crossing Shortest Paths are Covered with Exactly Four Forests
Given a set of paths P we define the Path Covering with Forest Number of...
share
research
∙
08/01/2022
Two New Characterizations of Path Graphs
Path graphs are intersection graphs of paths in a tree. We start from th...
research
∙
04/22/2022
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs
The vitality of an edge in a graph with respect to the maximum flow betw...
research
∙
01/31/2022
Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs
We study the problem of computing the vitality with respect to max flow ...
research
∙
02/22/2021
Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time
Given a set of terminal pairs on the external face of a planar graph wit...
research
∙
12/15/2020
A New Algorithm to Recognize Path Graphs
A Path Graph is the intersection graph of vertex paths in an undirected ...
research
∙
11/08/2020
Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs
Given a plane undirected graph G with non-negative edge weights and a se...
research
∙
11/20/2019