scientific article; zbMATH DE number 1234617

MaRDI QIDQ4221395zbMATH OpenFDO

Authors Taenam Kim, Dukhwan Oh, Eunki Lim

Publication date 14 March 1999

zbMATH Keywords

EREW PRAMEuler tourprefix sum

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• An efficient parallel algorithm for shifting the root of a depth first spanning tree
• scientific article; zbMATH DE number 54593
• Graph algorithms on a tree-structured parallel computer
• A Parallel Algorithm for Computing Minimum Spanning Trees

Cited in

(11)

• A simple parallel algorithm for computing the diameters of all vertices in a tree and its application
• A simple optimal parallel algorithm for a core of a tree
• Dissections of polygons into triangles of equal areas
• Note on the outdegree of a node in random recursive trees
• The smallest triangular cover for triangles of diameter one
• The lower bound of the number of non-overlapping triangles.
• Point transversals to translates of a trapezoid.
• A new approach to operating with undirected trees
• scientific article; zbMATH DE number 5942279 (Why is no real title available?)
• An efficient parallel algorithm for shifting the root of a depth first spanning tree
• Tilings of parallelograms with similar triangles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221395)