Pages that link to "Item:Q5617637"

The following pages link to An algorithm for the chromatic number of a graph (Q5617637):

Displaying 24 items.

• Co-2-plex vertex partitions (Q498448) (← links)
• Enumerating maximal independent sets with applications to graph colouring. (Q703280) (← links)
• A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833) (← links)
• A method of synthesis of linear discriminant function in the case of nonseparability (Q793475) (← links)
• Matchings in simplicial complexes, circuits and toric varieties (Q868883) (← links)
• Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
• A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
• A graph coloring algorithm for large scale scheduling problems (Q1096533) (← links)
• Clique detection for nondirected graphs: Two new algorithms (Q1143177) (← links)
• Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
• A note on the complexity of the chromatic number problem (Q1229753) (← links)
• Data parallel computing for network-structured optimization problems (Q1328430) (← links)
• On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
• Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (Q2028085) (← links)
• Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
• An algorithm for obtaining the chromatic number and an optimal coloring of a graph (Q2264680) (← links)
• Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
• Graph theoretic algorithm for automatic operation sequencing for progressive die design (Q3498881) (← links)
• A Moderately Exponential Time Algorithm for Full Degree Spanning Tree (Q3502671) (← links)
• Efficient bounds on a branch and bound algorithm for graph colouration (Q4009325) (← links)
• PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS (Q4820107) (← links)
• (Q5376962) (← links)
• Faster graph coloring in polynomial space (Q5925619) (← links)