Computing transitive closure of bipolar weighted digraphs

DOI10.1016/J.DAM.2012.06.013MaRDI QIDQ1759882zbMATH OpenOpenAlexFDO

Authors Patrick Niesink, Keven Poulin, Mateja Šajna

Publication date 22 November 2012

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.06.013

zbMATH Keywords

transitive closurefuzzy cognitive mapbipolar fuzzy digraphbipolar random digraphbipolar weighted digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22) Fractional graph theory, fuzzy graph theory (05C72)

Recommendations

• On the transitive closure of reciprocal \([0, 1]\)-valued relations
• Transitive closure and transitive reduction in bidirected graphs
• scientific article; zbMATH DE number 813252
• Efficient computation of transitive closures
• The transitive closure of a random digraph

Cited in

(3)

• Fuzzy random walkers with second order bounds: an asymmetric analysis
• Bipolar fuzzy graph representation of concept lattice
• Transitive closure and transitive reduction in bidirected graphs

This page was built for publication: Computing transitive closure of bipolar weighted digraphs

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