The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Minimal Steiner tree problem on graphs is a traditional optimization problem, which has wide- spread use in different application areas. Greedy heuristics for all the people to use the problem are using the shortest path heuristic, and various variants are also used. In this paper, a new heuristic for solving STPG is proposed. The new heuristic defined a novel neighborhood for local search methods...
We present a Monte Carlo algorithm for Hamiltonicity detection in an n-vertex undirected graph running in O* (1.657n) time. To the best of our knowledge, this is the first superpolynomial improvement on the worst case runtime for the problem since the O*(2n) bound established for TSP almost fifty years ago (Bellman 1962, Held and Karp 1962). It answers in part the first open problem in Woeginger's...
Summary form only given. A common task in probabilistic modeling is finding the assignment with maximum probability given a model. This is often referred to as the MAP (maximum a-posteriori) problem. Of particular interest is the case of MAP in graphical models, i.e., models where the probability factors into a product over small subsets of variables. For general models, this is an NP-hard problem,...
The minimum connected dominating set (MCDS) of a given graph G is the smallest sub-graph of G such that every vertex in G belongs either to the sub-graph or is adjacent to a vertex of the sub-graph. Finding the MCDS in an arbitrary graph is a NP-Hard problem, and several approximation algorithms have been proposed for solving this problem in deterministic graphs, but to the best of our knowledge no...
Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if it is uniquely determined by the input distances. In this paper, we show the following: if the sensors are allowed to wiggle, giving us perturbed distance data, we can apply a novel algorithm to realize arbitrary generically...
We present a novel method for transforming graph theoretical problems into optimization problems and computing the minimum spanning tree (MST) of weighted and undirected graphs. The computing using Cellular Neural Networks (CNN) is considered for ultra-fast solutions when dealing with graphs of complex topology. As proof of concepts of the proposed method, simulations are performed on graphs of magnitude...
DNA assembly problem is well known for its high complexity both on biological and computational levels. Traditional laboratory approach to the problem, which involves DNA sequencing by hybridization or by gel electrophoresis, entails a lot of errors coming from experimental and algorithmic stages. DNA sequences constituting the traditional assembly input have lengths about a few hundreds of nucleotides...
Hardware/software (HW/SW) partitioning is one of the key challenges in HW/SW co-design. This paper presents a new formulation to handle the HW/SW partitioning problem, which has been proved to be NP-hard. The proposed formulation transforms the partitioning problem into an extended 0-1 knapsack problem that is approximately solved in this paper by scanning a one-dimensional search space, instead of...
In this paper we describe a method to lay out a graph enhanced Euler diagram so that it looks similar to a previously drawn graph enhanced Euler diagram. This task is nontrivial when the underlying structures of the diagrams differ. In particular, if a structural change is made to an existing drawn diagram, our work enables the presentation of the new diagram with minor disruption to the user's mental...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.