Pages that link to "Item:Q2489951"
From MaRDI portal
The following pages link to On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951):
Displaying 9 items.
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- On the probabilistic min spanning tree problem (Q1935723) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Vertex-Uncertainty in Graph-Problems (Q5505652) (← links)
