Learn More
A simple parallel randomized algorithm to find a maximal independent set in a graph G = (V, E) on n vertices is presented. Its expected rmming time on a concurrent-read concurrent-write PRAM with 0( 1 E 1 d,,) processors is O(log n), where d,, denotes the maximum degree. On an exclusive-read exclusive-write PRAM with 0( 1 El) processors the algorithm runs(More)
The time-complexity of deterministic and randomized protocols for achieving broadcast (distributing a message from a source to all other nodes) in arbitrary multi-hop radio networks is investigated. In many such networks, communication takes place in synchronous time-slots. A processor receives a message at a certain time-slot if exactly one if its(More)
Finding minimum circuits in graphs and digraphs is discussed. An almost minimum circuit is a circuit which may have only one edge more than the minimum. An <italic>0(n<supscrpt>2</supscrpt>)</italic> algorithm is presented to find an almost minimum circuit. The straightforward algorithm for finding a minimum circuit has an <italic>0(ne)</italic> behavior.(More)
The time-complexity of deterministic and randomized protocols for achieving broadcast (distributing a message from a source to all other nodes) in arbitrary multi-hop radio networks is investigated. In these networks communication takes place in synchronous time-slots. A processor receives a message at a certain time-slot if exactly one if its neighbors(More)
A grid graph is a node-induced finite subgraph of the infinite grid. It is rectangular if its set of nodes is the product of two intervals. Given a rectangular grid graph and two of its nodes, we give necessary and sufficient conditions for the graph to have a Hamilton path between these two nodes. In contrast, the Hamilton path (and circuit) problem for(More)
This paper presents a new approach for resolving lexical ambiguities in one language using statistical data from a monolingual corpus of another language. This approach exploits the differences between mappings of words to senses in different languages. The paper concentrates on the problem of target word selection in machine translation, for which the(More)
Two tasks of communication in a multi-hop synchronous radio network are considered: point-topoint communication and broadcast (sending a message to all nodes of a network). Efficient protocols for both problems are presented, Even though the protocols are probabilistic, it is shown how to acknowledge messages deterministically. Let n, D, and A be the number(More)
Let G(V, E) be an undirected graph. A set M ~ E is a matching if no two edges of M have a common vertex. The matching M is maximal if it is not properly contained in any other matching. Note that this does not necessarily imply that M has more edges than any other matching. A maximal matching can be found sequentially by the following greedy algorithm:(More)