Pages that link to "Item:Q861322"
From MaRDI portal
The following pages link to Conflict-free star-access in parallel memory systems (Q861322):
Displaying 12 items.
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- The equitable vertex arboricity of complete tripartite graphs (Q495689) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- \((N, p)\)-equitable \(b\)-coloring of graphs (Q1682874) (← links)
- Equitable coloring of some convex polytope graphs (Q1794705) (← links)
- A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
- On the equitable vertex arboricity of complete tripartite graphs (Q2788734) (← links)
- A Tabu Search Heuristic for the Equitable Coloring Problem (Q3195344) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)
- On the equitable vertex arboricity of graphs (Q5739585) (← links)
- Template-driven rainbow coloring of proper interval graphs (Q5896886) (← links)
- Template-driven rainbow coloring of proper interval graphs (Q5925620) (← links)
