Showing papers in "Information Processing Letters in 1993"

TL;DR: The algorithm can be used as a building block for solving other distributed graph problems, and can be slightly modified to run on a strongly-connected diagraph for generating the existent Euler trail or to report that no Euler trails exist.

TL;DR: A simple universal strategy scL univ, with the property that, for any algorithm A, T ( A, scLUniv ) = O( lin A log( linA )), is described, which is the best performance that can be achieved, up to a constant factor, by any universal strategy.

TL;DR: A simple FAS algorithm which guarantees a good (though not optimal) performance bound and executes in time O(m) is presented and achieves the same asymptotic performance bound that Berger-Shor does.

TL;DR: An approximation algorithm for graph coloring is presented which achieves a performance guarantee of O(n( log log n) 2 (log n) 3 ) , a factor oflog log n improvement.

TL;DR: An O(n4.5 log n + V) algorithm to determine the largest agreement subtree of two trees on n leaves, where V is the maximum number of nodes in the trees.

TL;DR: In this article, it was shown that there is no constant e>0 for which this problem can be approximated within a factor of n 1−e in polynomial time unless P  NP.

TL;DR: An algorithm for the doubly lexical ordering problem on a 0-1 i by j matrix which runs in O( ij ) time is presented, which improves the time bounds for determining whether a dense 0–1 matrix is totally balanced, and determiningWhether a dense graph is strongly chordal or chordal bipartite.

TL;DR: The fault-diameter of the star graph is derived using a combinatorial method based on counting the number of node-disjoint paths of optimal length between a given pair of nodes in the graph and distributing the faulty nodes among these paths in a worst-case fashion.

TL;DR: An O( mn 2 ) time algorithm is presented that finds all-pairs quickest paths, for a given value of σ, and it is shown that the quickest path between any two nodes for any value ofπ can be found in O(log m ) time.

TL;DR: A new reduction algorithm which works in optimal linear time O(|G|) is presented, which is unique (up to isomorphisms) and can be computed from any OBDD G for f of size |G| in time O (¦G¦log¦ G¦).

TL;DR: It is shown that the feasibility problem on a single processor is NP-complete for a set of tasks with identical release times and two distinct deadlines, which gives a sharp boundary delineating the complexity of the problem.

TL;DR: Given n points in d dimensions, it is shown how to construct a data structure of space O( d 2 d n ) that approximately answers closest-point queries in time O (d 2 d log n ) per query.

TL;DR: An θ(λn 2 ) space data structure is proposed which allows to answer quickest path queries in O(log r) time and whose construction requires δ(min {mn 2, rn 2 log n+rnm}) time.

TL;DR: There is no mincut-model in general if only positive weights are allowed, and such models are constructed using positive and negative weights.

TL;DR: This structure, the level-compressed trie, inherits the good properties of binary tries with respect to neighbour and range searches, while the external path length is significantly decreased, and has the advantage of being easy to implement.

TL;DR: This work gives simple randomized and deterministic algorithms that compute g(i) such that ƒ( i) ⩽ g (i)⩽ Ɠ(i)(1 + e) for all i.

TL;DR: The tree and tour cover problems on an edge-weighted graph are to compute a minimum weight tree and closed walk, respectively, whose vertices from a vertex cover as discussed by the authors.

TL;DR: A new, simple proof of this lower bound that pairwise equal/not equal colour comparisons are necessary and sufficient to determine the majority color is presented.

TL;DR: It is shown that this oblivious protocol requires fewer messages than the known private protocols for modular addition, and is in a sense optimal, by proving a tight lower bound of ⌈n·(t+1)/2⌉ messages for any oblivious protocol that computes the sum t-privately.

TL;DR: A simple and practical algorithm is presented that finds the substring of T, which best matches some subst ring of P n ( P n is the concatenation of an arbitrary number of copies of P ).

TL;DR: An algorithm that uses the principle of inclusion and exclusion to determine the number of Hamiltonian paths in a given graph that have a given starting vertex and a given ending vertex has an upper bound on time complexity of O(2 n x n 4 ) where n is thenumber of vertices in the graph.

TL;DR: The problem of determining if a graph G has an efficient edge dominating set is NP-complete for general graphs as well as for line graphs and a linear-time algorithm for calculating the maximum number of edges that can be efficiently dominated in series-parallel graphs is presented.

TL;DR: A function in ACC 0 is presented such that any depth-3 threshold circuit which computes this function and has AND gates at the bottom must have size n ω(log n ).

TL;DR: This work reduces the runtime of the first heuristics finding approximate Steiner trees no longer than 11/6 times of the optimal length by reducing the time complexity of the all-pairs-shortest-paths problem.

TL;DR: The efficient applicability of the techniques for deciding the satisfiability of lexicographic path ordering constraints under two different semantics: solutions built over the given signature and solutions in extended signatures is discussed.

TL;DR: A randomized request sequence σs is constructed that no deterministic on-line algorithm can service with an expected cost less than 3 2 − 5 (n+5) times the off-line cost ( n denoting the length of the list).

TL;DR: It is shown that assembly partitioning is NP-complete and the result extends to several interesting variants of the problem.

TL;DR: It is proved that if Sn is the n-star graph then for any minimal length routing ρ diameter D(R(Sn,ρ)/F) is at most 3, as long as |F|