Pages that link to "Item:Q5576821"
From MaRDI portal
The following pages link to An Algorithm for Finding a Minimum Equivalent Graph of a Digraph (Q5576821):
Displaying 15 items.
- Minimal equivalent subgraphs containing a given set of arcs (Q528495) (← links)
- Reduction of a nilpotent fuzzy matrix (Q585325) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- Transitive reduction of a rectangular Boolean matrix (Q798324) (← links)
- Transitive reduction of a nilpotent Boolean matrix (Q800374) (← links)
- An algorithm for finding a minimal equivalent graph of a strongly connected digraph (Q1253667) (← links)
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- On strongly connected digraphs with bounded cycle length (Q1923587) (← links)
- Minimum equivalent precedence relation systems (Q2410264) (← links)
- Approximating Transitive Reductions for Directed Networks (Q3183442) (← links)
- Maximal and Maximum Transitive Relation Contained in a Given Binary Relation (Q3196418) (← links)
- Path-Contractions, Edge Deletions and Connectivity Preservation (Q5111736) (← links)
- The Role of Structural Reasoning in the Genesis of Graph Theory (Q5208125) (← links)
- Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067) (← links)
- Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
