Titlebook: VLSI Algorithms and Architectures; 3rd Aegean Workshop John H. Reif Conference proceedings 1988 Springer-Verlag New York 1988 VLSI.communi

浸軟

CURT

On finding lowest common ancestors: Simplification and parallelization,r for any pair of vertices in .. We present a linear time and space preprocessing algorithm which enables us to answer each query in . (1) time, as in Harel and Tarjan [HT-84]. Our algorithm has the advantage of being simple and easily parallelizable. The resulting parallel preprocessing algorithm r

CEDE

Assault

CON

不整齊

鋼筆記下懲罰

四溢

Conference proceedings 1988ized by the Computer Technology Institute in Patras in cooperation with ACM, EATCS, IEEE and the General Secretariat of Research and Technology (Ministry of Industry, Energy & technology of Greece). They were selected from 119 abstracts submitted in response to the program committee‘s call for paper

項(xiàng)目

的事物

Efficient parallel triconnectivity in logarithmic time, applications include almost optimal .(log.) time algorithms for recognizing Gauss codes, for testing planarity of graphs with a known Hamiltonian cycle and for testing if a permutation is sortable on two stacks.