Pages that link to "Item:Q5958320"
From MaRDI portal
The following pages link to A priori optimization for the probabilistic maximum independent set problem (Q5958320):
Displayed 10 items.
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- On the probabilistic min spanning tree problem (Q1935723) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← 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)