Pages that link to "Item:Q621840"
From MaRDI portal
The following pages link to A linear time algorithm for computing a most reliable source on a tree network with faulty nodes (Q621840):
Displaying 13 items.
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges (Q1274933) (← links)
- Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems. (Q1422361) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
- The approximability of multiple facility location on directed networks with random arc failures (Q2196606) (← links)
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges (Q2294142) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- Diameter-constrained Steiner trees (Q2905280) (← links)
- A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges (Q2905281) (← links)
- A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) (Q2958334) (← links)
- Linear time algorithms for computing the most reliable source on an unreliable tree network (Q4355484) (← links)
- On the Parameterized Complexity of the Expected Coverage Problem (Q5042243) (← links)
- An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges (Q5245845) (← links)
