Pages that link to "Item:Q1124350"
From MaRDI portal
The following pages link to An algorithm for transitive reduction of an acyclic graph (Q1124350):
Displaying 15 items.
- On building the transitive reduction of a two-dimensional poset (Q287116) (← links)
- Minimal equivalent subgraphs containing a given set of arcs (Q528495) (← links)
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- Transitive reduction of a nilpotent Boolean matrix (Q800374) (← links)
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs (Q930591) (← links)
- An improved algorithm for transitive closure on acyclic digraphs (Q1110330) (← links)
- A method of graph reduction and its applications (Q1669583) (← links)
- Origami fold as algebraic graph rewriting (Q2269692) (← links)
- Best match graphs (Q2420450) (← links)
- Construction of a transitive reduction of an acyclic digraph (Q2736119) (← links)
- Parallel algorithms for transitive reduction for weighted graphs (Q2812141) (← links)
- On digraphs with a rooted tree structure (Q3705478) (← links)
- Complexité de problèmes liés aux graphes sans circuit (Q3773334) (← links)
- (Q5091535) (← links)
- Transitive closure and transitive reduction in bidirected graphs (Q5227103) (← links)