Transitive closure and transitive reduction in bidirected graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4083002
- An alternative construction to the transitive closure of a directed graph
- scientific article; zbMATH DE number 992950
- Computing transitive closure of bipolar weighted digraphs
- An algorithm for transitive reduction of an acyclic graph
- Construction of a transitive reduction of an acyclic digraph
- scientific article; zbMATH DE number 3958732
- An improved algorithm for transitive closure on acyclic digraphs
- scientific article; zbMATH DE number 1208713
Cites work
- Erratum to: T. Zaslavsky, signed graphs
- scientific article; zbMATH DE number 3144144 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Nowhere-zero integral chains and flows in bidirected graphs
- On the notion of balance of a signed graph
- Orientation of signed graphs
- The Transitive Reduction of a Directed Graph
Cited in
(9)- Computing transitive closure of bipolar weighted digraphs
- Decomposition of a bidirected graph into strongly connected components and its signed poset structure
- Construction of a transitive reduction of an acyclic digraph
- scientific article; zbMATH DE number 3853102 (Why is no real title available?)
- Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure
- scientific article; zbMATH DE number 15496 (Why is no real title available?)
- scientific article; zbMATH DE number 1208713 (Why is no real title available?)
- An alternative construction to the transitive closure of a directed graph
- Bi-oriented graphs and four valued logic for preference modelling
This page was built for publication: Transitive closure and transitive reduction in bidirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227103)
