Pages that link to "Item:Q4532541"
From MaRDI portal
The following pages link to The Probabilistic Minimum Vertex-covering Problem (Q4532541):
Displaying 13 items.
- Minimum vertex cover in generalized random graphs with power law degree distribution (Q306728) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- The minimum likely column cover problem (Q1029075) (← links)
- A decomposition strategy for the vertex cover problem (Q1123907) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- On the probabilistic min spanning tree problem (Q1935723) (← links)
- On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- Probabilistic optimization in graph-problems (Q2865853) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
- Vertex-Uncertainty in Graph-Problems (Q5505652) (← links)
- A priori optimization for the probabilistic maximum independent set problem (Q5958320) (← links)