The following pages link to (Q3983100):
Displaying 7 items.
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Cooperative colorings and independent systems of representatives (Q2346466) (← links)
- An algorithm for identifying cycle-plus-triangles graphs (Q2357769) (← links)
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
- On finding constrained independent sets in cycles (Q6130317) (← links)
- Partitioning into common independent sets via relaxing strongly base orderability (Q6144384) (← links)
