Pages that link to "Item:Q3191564"
From MaRDI portal
The following pages link to Online graph edge-coloring in the random-order arrival model (Q3191564):
Displaying 7 items.
- The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
- Online edge coloring of paths and trees with a fixed number of colors (Q1702302) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- A 1.43-competitive online graph edge coloring algorithm in the random order arrival model (Q5417603) (← links)
- A MODEL OF GRAPH COLORING DYNAMICS WITH ATTENTION WAVES AND STRATEGIC WAITING (Q5851783) (← links)
- Online edge coloring via tree recurrences and correlation decay (Q6083466) (← links)
- Online Edge Coloring via Tree Recurrences and Correlation Decay (Q6203478) (← links)