Pages that link to "Item:Q1274933"
From MaRDI portal
The following pages link to A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges (Q1274933):
Displaying 11 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)
- Multiple facility location on a network with linear reliability order of edges (Q1680498) (← 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)
- Nonexistence of uniformly most reliable two-terminal graphs (Q2235777) (← links)
- A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks (Q2672618) (← links)
- A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges (Q2905281) (← 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)
