Pages that link to "Item:Q935838"
From MaRDI portal
The following pages link to An improved approximation algorithm for maximum edge 2-coloring in simple graphs (Q935838):
Displaying 6 items.
- Approximating maximum edge 2-coloring in simple graphs (Q608271) (← links)
- Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422) (← links)
- Approximating maximum edge 2-coloring in simple graphs via local improvement (Q1035687) (← links)
- Improved approximation for maximum edge colouring problem (Q2161229) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement (Q3511418) (← links)