Pages that link to "Item:Q4962714"
From MaRDI portal
The following pages link to An asymptotic approximation scheme for multigraph edge coloring (Q4962714):
Displaying 10 items.
- Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- Minimum multiplicity edge coloring via orientation (Q1671364) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
- An asymptotic approximation scheme for multigraph edge coloring (Q2921756) (← links)
- Approximating maximum edge coloring in multigraphs (Q4411281) (← links)
- Efficiently list-edge coloring multigraphs asymptotically optimally (Q5146931) (← links)
- Experimental and Efficient Algorithms (Q5710064) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)