Shortest Paths between Shortest Paths and Independent Sets
نویسندگان
چکیده
We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length. Moreover, we also study reconfiguration of independent sets in three different models and analyze relationships between these models, observing that shortest path reconfiguration is a special case of independent set reconfiguration in perfect graphs, under any of the three models. Finally, we give polynomial results for restricted classes of graphs (even-hole-free and P4-free graphs).
منابع مشابه
A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملOn the Representability of Arbitrary Path Sets as Shortest Paths: Theory, Algorithms, and Complexity
The question, whether an optional set of routes can be represented as shortest paths, and if yes, then how, has been a rather scarcely investigated problem up until now. In turn, an algorithm that, given an arbitrary set of traffic engineered paths, can efficiently compute OSPF link weights as to map the given paths to shortest paths may be of huge importance in today’s IP networks, which still...
متن کاملTrajectories and Traces on Non-traditional Regular Tessellations of the Plane
In this paper, shortest paths on two regular tessellations, on the hexagonal and on the triangular grids, are investigated. The shortest paths (built by steps to neighbor pixels) between any two points (cells, pixels) are described as traces and generalized traces on these grids, respectively. In the hexagonal grid, there is only one type of usual neighborhood and at most two directions of the ...
متن کاملOn monophonic sets in graphs1
Classical convexity can be naturally translated to graphs considering shortest paths, giving rise to the geodesic convexity. Moreover, if we consider induced paths between vertices, we get the so-called monophonic convexity. In this work, we present some results involving monophonic sets.
متن کاملMulti - Terminal Shortest Paths
The present paper gives an algorithm that finds simultaneously the shortest paths between many pairs of nodes in a given network. In the book by Berge, the values of shortest paths between many pairs of nodes are found. Here, we use a special matrix multiplication technique to find the actual arcs that are used to form the shortest paths. In a network with n nodes, log [n-l] special matrix mult...
متن کامل