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.
Motivated by the concept of reverse signed domination, we introduce the reverse minus domination problem on graphs and study the problem from the algorithmic point of view. For strongly chordal graphs and distance-hereditary graphs, we show that the reverse minus domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees. For chordal graphs...
An orthogonal ray graph is a graph such that for each vertex, there exists an axis-parallel rays (closed half-lines) in the plane, and two vertices are adjacent if and only if the corresponding rays intersect. A 2-directional orthogonal ray graph is an orthogonal ray graph such that the corresponding ray of each vertex is a rightward ray or a downward ray. We recently showed in [12] that the weighted...
Automation of generating test data is an adequate solution for testing software. Moreover, solving constraints is one of the most important parts of this process. Each constraint is a condition along which there is a vector with different variables' values involves in condition to satisfy the constraint. Despite the fact that previous methods have investigated the solver vectors by decreasing the...
Backdoor sets of SAT problem can quickly decide the satisfiability of real-world SAT instances, and the QBF problem is the generalization of SAT problem, so backdoor sets of QBF are crucial to its solution. We propose a new algorithm of computing QHorn deletion backdoor sets in this paper, which contains two stages. Firstly, we compute renamed QBF formula according to the largest renamable Rmax of...
Wireless growth has been limited by the shortage of radio spectrum. While the spectrum assigned to legacy technologies remain unused, new prominent technologies such as Mesh/WiFi networks are forced to crowd into a small unlicensed band, suffering from significant interference and degraded performance. Using economic incentives, dynamic spectrum auctions redistribute spectrum to make it available...
Wireless sensor networks consist of a large number sensors spread across a given geographical area. Each sensor has its own communication capability as well as certain level of intelligence for signal processing and networking. As the sensor nodes are densely populated, communication range requirement for these nodes is smaller. After signal detection, a number of sensor nodes communicate over the...
A new parallel algorithm for the maximal independent set problem (MIS) is constructed. It runs in O(log4 n) time when implemented on a linear number of EREW-processors. This is the first deterministic algorithm for MIS whose running time is polylogarithmic and whose processor-time product is optimal up to a polylogarithmic factor.
A k-ratio edge separator is a set of edges which separates a weighted graph into two disconnected sets of components neither of which contains more than k-1/k of the original graph's weight. An optimal quotient separator is an edge separator where the size of the separator (i.e., the number of edges) divided by the weight of the smaller set of components is minimized. An optimal quotient k-ratio separator...
This paper discusses some new integer factoring methods involving cyclotomic polynomials. There are several polynomials f(X) known to have the following property: given a multiple of f(p), we can quickly split any composite number that has p as a prime divisor. For example -- taking f(X) to be X- 1 -- a multiple of p - 1 will suffice to easily factor any multiple of p, using an algorithm of Pollard...
We consider problems in computational geometry when every one of the input points is moving in a prescribed manner. We present and analyze efficient algorithms for a number of problems and prove lower bounds for some of them.
A combinatorial problem related to storage allocation is analyzed. The problem falls into a class of NP-complete, one-dimensional bin-packing problems. We propose an iterative approximation algorithm and show that it is superior to an earlier heuristic presented for this problem. The bulk of the paper is devoted to the proof of a worst-case performance bound.
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.