An extension of the multi-path algorithm for finding hamilton cycles
نویسنده
چکیده
The multi-path algorithm for finding hamilton cycles in a graph G is described in the book by Christofides. It is an intelligent exhaustive search for a hamilton cycle. In this paper we describe how the algorithm can be improved in two ways: (1) by detecting small separating sets M for which G–M has more than |M| components; and (2) by detecting bipartitions (X,Y), where |X|<|Y|.
منابع مشابه
Finding the Optimal Path to Restoration Loads of Power Distribution Network by Hybrid GA-BCO Algorithms Under Fault and Fuzzy Objective Functions with Load Variations
In this paper proposes a fuzzy multi-objective hybrid Genetic and Bee colony optimization algorithm(GA-BCO) to find the optimal restoration of loads of power distribution network under fault.Restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. To improve the efficiency of restoration and facilitate theactivity...
متن کاملFinding Hamilton cycles in robustly expanding digraphs
We provide an NC algorithm for finding Hamilton cycles in directed graphs with a certain robust expansion property. This property captures several known criteria for the existence of Hamilton cycles in terms of the degree sequence and thus we provide algorithmic proofs of (i) an ‘oriented’ analogue of Dirac’s theorem and (ii) an approximate version (for directed graphs) of Chvátal’s theorem.
متن کاملAn Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
متن کاملAn Algorithm for Finding Hamilton Cycles in Random Directed Graphs
We describe a polynomial (O( n’.‘)) time algorithm DHAM for finding hamilton cycles in digraphs. For digraphs chosen uniformly at random from the set of digraphs with vertex set (1,2,. . . , n } and m = m(n) edges the limiting probability (as n + co) that DHAM finds a hamilton cycle equals the limiting probability that the digraph is hamiltonian. Some applications to random “ travelling salesma...
متن کاملImproving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 101 شماره
صفحات -
تاریخ انتشار 1992