scispace - formally typeset
Search or ask a question

Showing papers in "Information Processing Letters in 1994"


Journal ArticleDOI
TL;DR: In graphs of bounded arboricity, the total complexity of all maximal complete bipartite subgraphs is O(n), and a linear time algorithm is described to list such sub graphs.

163 citations


Journal ArticleDOI
TL;DR: Given two rooted, labeled, and unordered trees, it is shown that both problems are MAX SNP-hard, which means that neither problem has a polynomial time approximation scheme (PTAS) unless P = NP.

159 citations


Journal ArticleDOI
TL;DR: Two improved versions of Tarjan's algorithm for the detection of strongly connected components in a directed graph are presented, one of which handles sparse graphs and graphs with many trivial components more economically thanTarjan's original algorithm.

158 citations


Journal ArticleDOI
TL;DR: It is shown that every oriented planar graph G = (V,A) with d-(x) ⩽ 3 for every x ϵ V has a good and semi-strong coloring using at most 4 x 5 x 24 colors.

143 citations


Journal ArticleDOI
TL;DR: A distributed self-stabilizing Depth-First Search (DFS) spanning tree algorithm, whose output is a DFS spanning tree of the communication graph, kept in a distributed fashion.

142 citations


Journal ArticleDOI
TL;DR: This paper provides an algorithm to find all occurences of a pattern string of length m in a textString of length n under the parameterized pattern matching model, which takes time O(n log π), independent of |Σ|.

128 citations


Journal ArticleDOI
Helmut Seidl1

103 citations


Journal ArticleDOI
TL;DR: The competitive ratio of the best algorithm for m-machine scheduling is studied and it is shown that if m ⩾ 3454, then the competitive ratios of every algorithm exceeds 1.707, which means the best upper bound on the competitive ratio is now 1.837.

103 citations


Journal ArticleDOI
TL;DR: A new data structure is presented that allows such queries to be answered very quickly even for huge sets if the words are not too long and the query is quite close.

98 citations


Journal ArticleDOI
TL;DR: It is proved that the NP-hard problem of finding in an undirected graph G a spanning tree with a maximum number of leaves is MAX-SNP hard, giving therefore a negative answer to this question, which was left open in [6].

95 citations


Journal ArticleDOI
TL;DR: The problem considered in this paper is to find the first k quickest simple paths for a given pair of nodes, and an algorithm is designed.

Journal ArticleDOI
TL;DR: This presentation is based on a semantic formalism that combines the benefits of the approaches considered by Wright and Felleisen, and by Tofte, leading to a particularly simple proof of soundness of T ofte's type discipline.


Journal ArticleDOI
TL;DR: The main result is an O(|A| + d3max) algorithm that produces a solution with at least a fraction 1 2 +ω( 1 d max ) of the number of arcs in an optimal solution.

Journal ArticleDOI
TL;DR: It is proved that any randomized algorithm for on-line scheduling jobs on m identical parallel machines must have a worst case ratio at least mm/(mm−(m−1)m) for every m, which tends to 1.58 as m→∞.

Journal ArticleDOI
TL;DR: The characterization theorem gives rise to a simple recursive algorithm which computes all the covers of x in time Θ(n) in terms of an easily computed normal form for x.

Journal ArticleDOI
TL;DR: A different dynamic programming scheme is employed to reduce the time complexity to O( nm ) for this problem in permutation graphs.

Journal ArticleDOI
TL;DR: A parallel algorithm on an r-processor EREW PRAM with time complexity 0(n2/r + n log r) is presented, particularly, when r = 1, it is a sequential algorithm with 0((n2 log n)/r).

Journal ArticleDOI
TL;DR: A simplified proof that Brent/Spira restructuring of Boolean formulas can be improved to allow a Boolean formula to be transformed into an equivalent log depth formula of size O for arbitrary α >1 is presented.

Journal ArticleDOI
TL;DR: The strength of a network having non-negative edge weights, is the minimum over subsets A of edges, of the weight of A divided by the number of additional components created by deleting A, which can be computed in time O( n 4 ).

Journal ArticleDOI
TL;DR: It is proved that maximum H-matching (the problem of determining the maximum number of node-disjoint copies of the fixed graph H contained in a variable graph) is a M AX SNP-hard problem for any graph H that has three or more nodes in some connected component.

Journal ArticleDOI
TL;DR: It is shown that the missing happened before information does not affect the identification of consistent global checkpoints.

Journal ArticleDOI
TL;DR: A finite equational axiomatization is presented for MPA*δ, and it is proved that this axiom atization is complete with respect to strong bisimulation equivalence.

Journal ArticleDOI
TL;DR: It is shown that some of the interesting properties of Lyndon words generalize to the infinite case and certain topological properties of the set of infinite Lyndon words such as homeomorphism with a subspace of the Cantor space are discussed.

Journal ArticleDOI
TL;DR: It is shown that if there are c nodes in the set C the maximum can be identified in expected O(log c transmissions), and it is proved a matching lower bound which shows that this bound is optimal.

Journal ArticleDOI
TL;DR: Two existing consensus algorithms are modified to solve this stronger variant of Distributed Consensus that considers agreement on a value that is more than a single bit and requires that the agreed upon value be one of the processors' input values.

Journal ArticleDOI
TL;DR: A distributed k-mutual exclusion algorithm is proposed using a k-coterie, a natural extension of a coterie, and the message complexity is O(c) when conflicts with other processes in capturing a quorum do not occur.

Journal ArticleDOI
Gerard Tel1
TL;DR: By providing an alternative variant function, the time complexity of Hsu and Huang's self-stabilizing algorithm for maximal matching to be bounded by 1 2 n2 + 2n + 1 steps is shown.

Journal ArticleDOI
TL;DR: This paper solves the special case of the Euclidean Traveling Salesman Problem where n − m cities lie on the boundary of the convex hull of all n cities, and the other m cities lying on a line segment inside this convex Hull by an algorithm which needs O time and space.