Graph Collision
نویسندگان
چکیده
We present three new quantum algorithms in the quantum query model for graph-collision problem: – an algorithm based on tree decomposition that uses O (√ nt 1/6 ) queries where t is the treewidth of the graph; – an algorithm constructed on a span program that improves a result by Gavinsky and Ito. The algorithm uses O( √ n + √ α∗∗) queries, where α∗∗(G) is a graph parameter defined by α(G) := min V C – vertex cover of G max I⊆V C I – independent set ∑
منابع مشابه
طراحی کنترلگر تعقیب مسیر هماهنگ برای گروه شناور زیرسطحی با در نظر گرفتن مسئله اجتناب از برخورد
In this paper the problem of coordinated path following for a group of Autonomous Underwater Vehicle (AUV) subjected to obstacle and collision avoidance is considered. At first a back stepping controller is used for an AUV to design a path following controller and its stability is examined via Lyapunov criteria. Then using of graph theory, modeling of interconnection between AUV systems is addr...
متن کاملA quantum query algorithm for the graph collision problem
We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is O( √ n + √ α(G)), where n is the number of vertices and α∗(G) is the maximum total degree of the vertices in an independent set of G. Notably, if G is a random g...
متن کاملCoupling force-based and graph-based models for multi-agent wayfinding in complex environments
In this paper, we propose a new 2D simulation model for large-scale pedestrian crowds. The agents in the model navigate along a navigation graph that represents all possible paths in the environment. Therefore the agents compute a route in the navigation graph from their origin to the desired destination. While moving along the graph, the agents keep track on the other agents and obstacles in t...
متن کاملFractal structure in the collision of vector solitons
We study the collision of two orthogonally polarized and equal-amplitude vector solitons in the nonintegrable coupled nonlinear Schrodinger equations. We show that the separation velocity versus collision velocity graph has a fractal structure. When we zoom into this graph, we get a structure qualitatively identical to the original one. In addition, collision dynamics in the zoomed-in windows i...
متن کاملGraceful Degradation of Collision Handling Physically Based Animation
Interactive simulation is made possible in many applications by simplifying or culling the finer details that would make real-time performance impossible. This paper examines detail simplification in the specific problem of collision handling for rigid body animation. We present an automated method for calculating consistent collision response at different levels of detail. The mechanism works ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013