1. What is the separation problem in algorithmic graph theory?
The separation problem in algorithmic graph theory refers to finding a smallest set of vertices whose deletion disconnects two designated vertices. This problem is fundamental in graph theory and has applications related to network connectivity. It is known to be polynomial-time solvable in static graphs. However, with the growth of dynamically changing network structures, the study of temporal graphs has gained significant attention. Temporal graphs have a fixed vertex set but edge sets that change over discrete time steps. The separation problem in temporal graphs has been found to be NP-hard, motivating the study of parameterized complexity and complexity behavior on special temporal graphs. Despite the challenges, researchers have achieved fixed-parameter tractability for Temporal (s, z)-Separation under certain restrictions, such as when parameterized by the separator size or the 'shuffle number'.
read more
2. What is the computational complexity of finding temporal separators in split graphs?
The computational complexity of finding temporal separators in split graphs involves analyzing the partitioning of the graph into cliques and independent sets. Split graphs represent core-periphery structures with a well-connected core and a periphery only connected to that core. They also constitute the majority of all chordal graphs. A split graph can have multiple split partitions, and a temporal split graph is a temporal graph where every layer is a split graph. A temporal split partition contains a split partition of every layer of the graph. The complexity of finding temporal separators in split graphs depends on the specific algorithm used and the size and structure of the graph. Researchers can explore various approaches to optimize the computational complexity and improve the efficiency of finding temporal separators in split graphs.
read more
3. What is a permutation graph?
A permutation graph is defined by an ordered set of vertices and any permutation of that vertex set. Two vertices are connected by an edge if and only if their relative order is inverted by the permutation. Formally, a graph G = (V, E) with vertex set V = [n] := {1, 2, ..., n} is a permutation graph if there exists a permutation p: V - V of the vertices such that for any two vertices v < w, {v, w} E if and only if p(w) < p(v).
read more
4. Is Temporal (s, z)-Separation fixed-parameter tractable with only parameterizing by p?
The section discusses the complexity of Temporal (s, z)-Separation on temporal split graphs. It remains NP-complete when parameterized by the lifetime t combined with the number p of 'switching vertices'. However, it becomes fixed-parameter tractable when parameterized by both t and p. The complexity of the problem when only parameterized by p remains open for future research. The section also mentions the conjecture that Temporal (s, z)-Separation is fixed-parameter tractable with respect to the maximum size of the independent set. Additionally, the complexity of Temporal (s, z)-Separation on temporal permutation graphs is discussed, with the problem becoming fixed-parameter tractable when parameterized by the separator size k plus the sum d S of Kendall tau distances of permutations of consecutive layers. The complexity of the problem when parameterized by either only the separator size k or only the sum d S of Kendall tau distances of permutations of consecutive layers remains open. Lastly, the section leaves the question of whether the results hold in the strict case open for future research.
read more