Pages that link to "Item:Q1923587"
From MaRDI portal
The following pages link to On strongly connected digraphs with bounded cycle length (Q1923587):
Displaying 17 items.
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs (Q930591) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574) (← links)
- On \(k\)-strong and \(k\)-cyclic digraphs (Q1356647) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- Dual power assignment via second Hamiltonian cycle (Q1686228) (← links)
- On complete strongly connected digraphs with the least number of 3-cycles (Q1923478) (← links)
- Structure of cycles in minimal strong digraphs (Q2420406) (← links)
- DAG-width and circumference of digraphs (Q2811203) (← links)
- Strongly Connected Spanning Subgraph for Almost Symmetric Networks (Q3132920) (← links)
- Approximating Transitive Reductions for Directed Networks (Q3183442) (← links)
- On longest cycles and strongly linking vertex sets (Q4206762) (← links)
- On strong digraphs with a prescribed ultracenter (Q4209979) (← links)
- Loop conditions for strongly connected digraphs (Q4960455) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- 1.61-approximation for min-power strong connectivity with two power levels (Q5963620) (← links)
