Pages that link to "Item:Q1209350"
From MaRDI portal
The following pages link to The greedy algorithm is optimal for on-line edge coloring (Q1209350):
Displaying 19 items.
- On-line algorithms for the dominating set problem (Q290186) (← links)
- Graph coloring with rejection (Q632809) (← links)
- Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614) (← links)
- Comparing first-fit and next-fit for online edge coloring (Q964390) (← links)
- Bounded families for the on-line \(t\)-relaxed coloring (Q1044722) (← links)
- On-line edge-coloring with a fixed number of colors (Q1566383) (← links)
- Maximal edge-colorings of graphs (Q1696530) (← links)
- Online edge coloring of paths and trees with a fixed number of colors (Q1702302) (← links)
- A new vertex coloring heuristic and corresponding chromatic number (Q2196603) (← links)
- Inequalities for the Grundy chromatic number of graphs (Q2462396) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Performance ratio of the generalized greedy algorithm for \(q\)-coloring problem (Q2826435) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- Online graph edge-coloring in the random-order arrival model (Q3191564) (← links)
- Online Dual Edge Coloring of Paths and Trees (Q3453294) (← links)
- A 1.43-competitive online graph edge coloring algorithm in the random order arrival model (Q5417603) (← links)
- Maximal edge colorings of graphs (Q6181990) (← links)
- Online Edge Coloring via Tree Recurrences and Correlation Decay (Q6203478) (← links)
- Maximal edge-colorings of graphs (Q6621153) (← links)
