Pages that link to "Item:Q3725544"
From MaRDI portal
The following pages link to A better than “best possible” algorithm to edge color multigraphs (Q3725544):
Displaying 11 items.
- Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
- On a local protocol for concurrent file transfers (Q487273) (← links)
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- Analysis of approximate algorithms for edge-coloring bipartite graphs (Q673614) (← links)
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem (Q1079133) (← links)
- The linzertorte problem, or a unified approach to painting, baking and weaving (Q1081611) (← links)
- Routing and path multicoloring (Q1607124) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- On the fg-coloring of graphs (Q2277478) (← links)
- Using the minimum maximum flow degree to approximate the flow coloring problem (Q2675725) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← links)