On finding all unilaterally connected components of a digraph

DOI10.1016/0020-0190(76)90093-4zbMath0347.68031OpenAlexW1982098158MaRDI QIDQ1234170

Eshrat Arjomandi

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90093-4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99)

Related Items (1)

On computing large temporal (unilateral) connected components

Cites Work

• Parallel concepts in graph theory
• On the computational power of pushdown automata
• On cliques in graphs

This page was built for publication: On finding all unilaterally connected components of a digraph