منابع مشابه
Simple alternating path problem
Let A be a set of 2n points in general position on a plane, and suppose n of the points are coloured red while the remaining are coloured blue. An alternating path P of A is a sequence p1, p2,..., p2n of points of A such that p2i is blue and p2i+1 is red. P is simple if it does not intersect itself. We determine the condition under which there exists a simple alternating path P of A for the cas...
متن کاملThe Hamiltonian Alternating Path Problem
In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe an approach to solve the problem. This approach is based on constructing logical models for the problem. We use logical models for the Hamiltonian alternating path problem to solve the Hamiltonian path problem and the planning a typical working day for indoor service robots pro...
متن کاملSolving the Longest Simple Path Problem with Constraint-Based Techniques
The longest simple path problem on graphs arises in a variety of context, e.g., information retrieval, VLSI design, robot patrolling. Given an undirected weighted graph G = (V,E) , the problem consists of finding the longest simple path (i.e., no vertex occurs more than once) onG . We propose in this paper an exact and a tabu search algorithm for solving this problem. We show that our technique...
متن کاملRelations between automata and the simple k-path problem
Let G be a directed graph on n vertices. A k-path in G is a path p = v1 → . . . → vk in G. Given an integer k ≤ n, the SIMPLE k-PATH problem asks whether there exists a simple k-path in G. In case G is weighted, the MIN-WT SIMPLE k-PATH problem asks for a simple k-path in G of minimal weight. The fastest currently known deterministic algorithm for MIN-WT SIMPLE k-PATH by Fomin, Lokshtanov and S...
متن کاملAn alternating service problem
We consider a system consisting of a server alternating between two service points. At both service points there is an infinite queue of customers that have to undergo a preparation phase before being served. We are interested in the waiting time of the server. The waiting time of the server satisfies an equation very similar to Lindley’s equation for the waiting time in the GI/G/1 queue. We wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90276-n