Showing papers in "Journal of Algorithms in 1984"

TL;DR: The main result of this paper is that if the authors can draw a graph on a surface of genus g, then they can bisect it by removing $O(\sqrt{gn})$ vertices, best possible to within a constant factor.

TL;DR: An O(n log n) algorithm is presented to find all repetitions in a string of lenght n, which uses a variation of the Knuth-Morris-Pratt algorithm to finding all partial occurrences of a pattern within a text string.

TL;DR: It is shown that the monotone formula-size complexity of themonotone symmetric functions on n variables can be bounded above by a function of order O ( n 5.3 ).

TL;DR: Approximation algorithms are presented that provide guarantees of 1 2, 2 3 , and 3 4 the optimal number, at running time costs of O(n), O(nlogn), and O( nlog2n), respectively, and the average case behavior of these algorithms is explored via empirical tests on randomly generated sets of items.

TL;DR: It is proved that the Euclidean degree-3 MST problem is also NP-complete, thus leaving open only the case for K = 4, and implementing the “shortcutting phase” of Christofides' algorithm optimally is NP-hard.

TL;DR: The dynamic programming algorithm of J. B. Saxe for the bandwidth minimization problem is improved and it is shown that, for all k > 1, BANDWIDTH(k) can be solved in O(nk) steps and simultaneous O( nk) space, and that each problem is in NSPACE(log n).

TL;DR: Efficient recognition algorithms for totally balanced matrices are presented and a new completion algorithm for building a maximal totally balanced matrix from an arbitraryotally balanced matrix follows from these results.

TL;DR: Consider a matroid where each element has a real-valued cost and a color, red or green; a base is sought that contains q red elements and has smallest possible cost and an algorithm for the problem on general matroids is presented, along with a number of variations.

TL;DR: It is shown that the rule implies the Littlewood-Richardson rule and gives a combinatorial proof that the coefficient of Sλ in the product SμSν equals the coefficients of Sν in the expansion of the skew Schur function Sλμ.

TL;DR: An algorithm is described which generates a random labeled cubic graph on n vertices which yields a random (0,1)-matrix with prescribed row and column sums which yields procedures which, if successful, generate random labeled graphs with specified degree sequence and random labeled bipartite graphs withspecified degree sequences.

TL;DR: These algorithms compare favorably with the fastest known algorithm for general graphs which has a worst-case running time of O(n ∗ e ∗ α) .

TL;DR: The general assignment problem is shown to be NP-complete and O ( n log n ) algorithms for two special cases of the problem are presented.

TL;DR: It is proved that when all jobs have a common processing time P, the difference between the heuristic and the minimum lateness is bounded by P .

TL;DR: A polynomial algorithm is presented for the case where the upper bound on the number of available processors and the height of the precedence graph are both constants and the problem remains NP-complete.

TL;DR: A simple linear-time algorithm that solves all three recognition problems and is previously used in general planarity testing, called a pile of twin stacks is described.

TL;DR: A sequential graph coloring algorithm S and a strict distributed (broadcasting type) algorithm D are presented, and an analysis of their performance in scales of random graph spaces is presented.

TL;DR: An adaptive diagnosis algorithm is presented which uses a sequence of tests to identify a fault-free unit and requires at most 2 t − ν ( t ) tests, where t is the number of 1's in the binary representation of t.

TL;DR: A variant of the distribution sort approach which makes use of extra storage to sort a list of n elements in an average of about (2+ 2 )n=3.412...n probes into a table is presented.

TL;DR: This work introduces a new data structure, the contracted segment tree, which is a non-trivial modification of the well known segment tree and yields a time- and space-optimal algorithm for determining the contour of iso-oriented rectangles in 2-space.

TL;DR: The number of factors can be found, assuming suitable Riemann hypotheses, but in many interesting cases it is not possible to find the Galois group.

TL;DR: The results show that CAD systems manipulating merely the geometry of the layout without changing its topology can be efficiently implemented, however, systems that are also able to change the topology of the layouts have to solve hard, i.e., NP-complete, problems.

TL;DR: An O(n) iterative algorithm is presented which decides whether there exist real numbers α and β such that ai = [iα + β] (1 ⩽ i⩽ n) for suitable β = β(α).

TL;DR: A strong decomposition theorem for diagonal closure in terms of uni-directional closure is proved and an O ( n log n ) time and space algorithm for testing for safety and detecting deadlocks in locked transaction systems is obtained.

TL;DR: A parameterized family of algorithms is presented for the problem of finding all prime numbers up to a limit N, and a particular choice of parameters leads to an algorithm that requires only Θ(N) additions and that runs in o( N ) bits.

TL;DR: The process A n, the number of bins required to pack n pieces, is investigated, and the first two moments are computed when the piece sizes are uniformly distributed.

TL;DR: This paper presents an O ( n 5 ) algorithm to construct optimal binary split trees and other efficient algorithms to construct suboptimal split trees are also discussed.

TL;DR: It is demonstrated that it is possible in this case to overcome such a difficulty, and a polynomial algorithm for constructing an optimum split tree is presented.

TL;DR: Two matching heuristics are presented and the hyper-greedy method and the factor of two method, which produces a matching whose cost is at most max(4log2K, 4log2n) times optimal, plus lower-order terms.

TL;DR: The experimental data suggest that the algorithm for generating all k -subsets of the set [1, 2, …, n ] in lexicographical order is about 25% faster than the algorithm proposed by A. Nijenhuis and H. Wilf.

TL;DR: New algorithms are presented to select the k largest elements, and give their respective order, of a totally ordered set of n elements, when k is small compared to n, and one of them is optimal for a wide range of values of n and k.