A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph

DOI10.1080/09720529.2007.10698146MaRDI QIDQ3545835zbMATH OpenOpenAlexFDO

Authors Hon-Chan Chen

Publication date 11 December 2008

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2007.10698146

zbMATH Keywords

parallel algorithmspanning treetrapezoid graph

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Recommendations

• An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
• scientific article; zbMATH DE number 1960881
• scientific article; zbMATH DE number 1117869
• scientific article; zbMATH DE number 1281573
• scientific article; zbMATH DE number 2092300

Cites work

• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
• Additive Tree Spanners
• An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
• Trapezoid graphs and their coloring
• Tree Spanners

Cited in

(7)

• An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
• Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
• A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
• A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
• scientific article; zbMATH DE number 1117869 (Why is no real title available?)
• scientific article; zbMATH DE number 1960881 (Why is no real title available?)
• scientific article; zbMATH DE number 2159654 (Why is no real title available?)

This page was built for publication: A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph

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