Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter +1
Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal graphs, that is, grap…
cs.DM2017
Computational Complexity Aspects of Point Visibility Graphs
Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz +2
A point visibility graph is a graph induced by a set of points in the plane where the vertices of the graph represent the points in the point set and two vertices are adjacent if a…