Separating Path Systems
نویسندگان
چکیده
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every n-vertex graph admits a separating path system of size O(n) and prove this in certain interesting special cases. In particular, we establish this conjecture for random graphs of all densities and graphs with linear minimum degree. We also obtain tight bounds on the size of a minimal separating path system in the case of trees.
منابع مشابه
Sufficient conditions for the non-separating paths
For two vertices in a graph, a path between them is non-separating if the remaining graph is connected. A previous work shows that a nonseparating path always exists if the connectivity is more than two. In this paper, we show that to determine if there is a non-separating path is NPcomplete for graphs of connectivity one or two. Sufficient conditions for the existence of a nonseparating path o...
متن کاملThe effects of suspending medium on dielectrophoretic systems for separating and sorting carbon nanotubes
The separation of two different types of multi-walled carbon nanotubes is studied in a dielectrophoresis-based microchannel system in seven different solvents as the suspending medium. A simple model was developed to predict the behavior of the multi-walled carbon nanotubes in the above mentioned system. Then, the equations of motion for the multi-walled carbon nanotubes in that system were in...
متن کاملA Near-Optimal Separation Principle for Nonlinear Stochastic Systems Arising in Robotic Path Planning and Control
We consider nonlinear stochastic systems that arise in path planning and control of mobile robots. As is typical of almost all nonlinear stochastic systems, the optimally solving problem is intractable. We provide a design approach which yields a tractable design that is quantifiably nearoptimal. We exhibit a “separation” principle under a small noise assumption consisting of the optimal open-l...
متن کاملAlgorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
For given a pair of nodes in a graph, the minimum non-separating path problem looks for a minimum weight path between the two nodes such that the remaining graph after removing the path is still connected. The balanced connected bipartition (BCP2) problem looks for a way to bipartition a graph into two connected subgraphs with their weights as equal as possible. In this paper we present an O(N ...
متن کاملAlgorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (With errata)
For given a pair of nodes in a graph, the minimum non-separating path problem looks for a minimum weight path between the two nodes such that the remaining graph after removing the path is still connected. The balanced connected bipartition (BCP2) problem looks for a way to bipartition a graph into two connected subgraphs with their weights as equal as possible. In this paper we present an algo...
متن کامل