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

DOI10.1080/09720529.2007.10698146zbMath1162.05353OpenAlexW2014331195MaRDI QIDQ3545835

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

trapezoid graphspanning treeparallel algorithm

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

• Unnamed Item
• A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
• Trapezoid graphs and their coloring
• An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
• Additive Tree Spanners
• Tree Spanners

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