Pages that link to "Item:Q4565777"

The following pages link to An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem (Q4565777):

Displaying 13 items.

• Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
• An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
• An exact approach for the vertex coloring problem (Q429677) (← links)
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
• Uncertain vertex coloring problem (Q2001167) (← links)
• Graph coloring with decision diagrams (Q2118148) (← links)
• A metaheuristic approach for the vertex coloring problem (Q2901013) (← links)
• (Q2970217) (← links)
• Bounding vertex coloring by truncatedmultistage branch and bound (Q3157032) (← links)
• Iterative coloring extension of a maximum clique (Q4544221) (← links)
• Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring (Q6579767) (← links)
• Minimum partition into plane subgraphs: the CG:SHOP challenge 2022 (Q6579770) (← links)
• Solving the list coloring problem through a branch-and-price algorithm (Q6586219) (← links)