Pages that link to "Item:Q2467361"
From MaRDI portal
The following pages link to Efficient algorithms for finding critical subgraphs (Q2467361):
Displaying 9 items.
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Solution techniques for the large set covering problem (Q868387) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- An exact method for graph coloring (Q2489282) (← links)
- The maximum-impact coloring polytope (Q2968505) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
