Pages that link to "Item:Q4075493"
From MaRDI portal
The following pages link to An Algorithm for Finding a Minimal Equivalent Graph of a Digraph (Q4075493):
Displayed 10 items.
- Reduction of a nilpotent fuzzy matrix (Q585325) (← links)
- Extending IC-scheduling via the sweep algorithm (Q666039) (← links)
- Exploiting causality in gene network reconstruction based on graph embedding (Q782474) (← links)
- Transitive reduction of a nilpotent Boolean matrix (Q800374) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- An algorithm for finding a minimal equivalent graph of a strongly connected digraph (Q1253667) (← links)
- On strongly connected digraphs with bounded cycle length (Q1923587) (← links)
- Minimum equivalent precedence relation systems (Q2410264) (← links)
- Reduktion von Präzedenzstrukturen (Q4111262) (← links)
- Spanning <i>k</i>‐arc‐strong subdigraphs with few arcs in <i>k</i>‐arc‐strong tournaments (Q4810501) (← links)