Pages that link to "Item:Q4110937"

The following pages link to An application of graph coloring to printed circuit testing (Q4110937):

Displaying 29 items.

• Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
• Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
• A memetic algorithm for graph coloring (Q1043356) (← links)
• On the complexity of H-coloring (Q1100215) (← links)
• Precoloring extension. I: Interval graphs (Q1198648) (← links)
• Some results on visibility graphs (Q1201816) (← links)
• An adaptive, multiple restarts neural network algorithm for graph coloring (Q1268156) (← links)
• Rectangle-visibility representations of bipartite graphs (Q1363757) (← links)
• Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
• Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• Coloring large graphs based on independent set extraction (Q1761974) (← links)
• How many circuits determine an oriented matroid? (Q1786051) (← links)
• Determining bar-representability for ordered weighted graphs (Q1917046) (← links)
• An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
• On fractional cut covers (Q2312658) (← links)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
• An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
• A survey of local search methods for graph coloring (Q2489304) (← links)
• A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831) (← links)
• A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
• AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING (Q2868189) (← links)
• (Q4790880) (← links)
• Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs (Q5199506) (← links)
• Multi-agent oriented constraint satisfaction (Q5958494) (← links)
• Area, perimeter, height, and width of rectangle visibility graphs (Q6084671) (← links)
• Optimal algorithms for finding connected components of an unknown graph (Q6085701) (← links)
• New results on the robust coloring problem (Q6127005) (← links)
• Coloring of graphs associated with commutative rings (Q6584796) (← links)