Pages that link to "Item:Q1762162"
From MaRDI portal
The following pages link to A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162):
Displaying 8 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
