Pages that link to "Item:Q4355484"
From MaRDI portal
The following pages link to Linear time algorithms for computing the most reliable source on an unreliable tree network (Q4355484):
Displaying 13 items.
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodes (Q621840) (← links)
- Network location of a reliable center using the most reliable route policy (Q960392) (← links)
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges (Q1274933) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Multiple facility location on a network with linear reliability order of edges (Q1680498) (← links)
- On the 2-MRS problem in a tree with unreliable edges (Q1790110) (← links)
- A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256) (← 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)
- A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges (Q2905281) (← links)
- (Q4636166) (← links)
- An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges (Q5245845) (← links)
- Network reliability: Heading out on the highway (Q6087070) (← links)
