Pages that link to "Item:Q1007243"
From MaRDI portal
The following pages link to Approximation algorithm for maximum edge coloring (Q1007243):
Displaying 13 items.
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- Heuristic algorithms for the min-max edge 2-coloring problem (Q1791033) (← links)
- On \(\mathrm{M}_f\)-edge colorings of graphs (Q2158189) (← links)
- Improved approximation for maximum edge colouring problem (Q2161229) (← links)
- The Min-Max Edge q-Coloring Problem (Q3196318) (← links)
- The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks (Q3503543) (← links)
- Optimal edge coloring of large graphs (Q4262695) (← links)
- Approximating maximum edge coloring in multigraphs (Q4411281) (← links)
- Efficient algorithms for the edge-cover coloring problem (Q5063668) (← links)
- Complexity of Computing the Anti-Ramsey Numbers for Paths. (Q5089164) (← links)
- (Q5501309) (← links)
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring (Q6197752) (← links)
- Approximating maximum edge 2-coloring by normalizing graphs (Q6574923) (← links)