Computing the Weak Components of a Directed Graph

DOI10.1137/0203005MaRDI QIDQ4056035zbMATH OpenOpenAlexFDO

Authors Jean Francois Pacault

Publication date 1974

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0203005

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99)

Cited in

(2)

• A new algorithm for finding weak components
• Recursive computation of path homology for stratified digraphs

This page was built for publication: Computing the Weak Components of a Directed Graph

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