Parallel algorithms for transitive reduction for weighted graphs

MaRDI QIDQ2812141zbMATH OpenFDO

Authors Dragan Bošnački, Willen Ligtenberg, Maximilian Odenbrett, Anton Wijs, Peter A. J. Hilbers

Publication date 16 June 2016

Published in Mathematica Macedonica (Search for Journal in Brave)

Full work available at URL http://im-pmf.weebly.com/uploads/5/8/9/8/58988609/transitivereductionmm.pdf

zbMATH Keywords

graph algorithmstransitive reductionweighted graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10)

Recommendations

• High-Probability Parallel Transitive-Closure Algorithms
• An algorithm for transitive reduction of an acyclic graph
• Inferring (biological) signal transduction networks via transitive reductions of directed graphs
• scientific article; zbMATH DE number 4083002
• scientific article; zbMATH DE number 1953900

Cited in

(2)

• Term rewriting on GPUs
• Exploiting causality in gene network reconstruction based on graph embedding

This page was built for publication: Parallel algorithms for transitive reduction for weighted graphs

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