scientific article; zbMATH DE number 1960881

MaRDI QIDQ4415792zbMATH OpenFDO

Authors Hirotoshi Honma

Publication date 7 August 2003

zbMATH Keywords

linear time sequential algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph
• Parallel breadth-first search algorithms for trees and graphs
• scientific article; zbMATH DE number 1117869
• Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
• Efficient parallel algorithms for breadth first spanning forests of general graphs
• A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
• A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs
• Unrestricted and complete breadth-first search of trapezoid graphs in O(n) time
• scientific article; zbMATH DE number 1522928
• Parallel algorithms for the domination problems in trapezoid graphs

Cited in

(7)

• An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
• A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
• A simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph
• Efficient parallel algorithms for breadth first spanning forests of general graphs
• scientific article; zbMATH DE number 1117869 (Why is no real title available?)
• Unrestricted and complete breadth-first search of trapezoid graphs in O(n) time
• Recognizing breadth-first search trees in linear time

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 Q4415792)