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

DOI10.1080/09720529.2007.10698146zbMATH Open1162.05353OpenAlexW2014331195MaRDI QIDQ3545835FDOQ3545835

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

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

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)

Cites Work

• Tree Spanners
• Trapezoid graphs and their coloring
• An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
• A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
• Title not available (Why is that?)
• Additive Tree Spanners

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
• An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
• Title not available (Why is that?)
• 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

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)