Pages that link to "Item:Q3783599"

The following pages link to Efficient parallel algorithms for edge coloring problems (Q3783599):

Displaying 21 items.

• A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
• A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924) (← links)
• Optimally edge-colouring outerplanar graphs is in NC (Q909461) (← links)
• An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors (Q914387) (← links)
• An NC algorithm for Brooks' theorem (Q1124351) (← links)
• Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
• The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
• Fast parallel edge colouring of graphs. (Q1414732) (← links)
• Efficient algorithms for path partitions (Q1813975) (← links)
• Parallel algorithms for the edge-coloring and edge-coloring update problems (Q1911806) (← links)
• Improved distributed degree splitting and edge coloring (Q2189174) (← links)
• Generalized edge-colorings of weighted graphs (Q2798333) (← links)
• (Q3708831) (← links)
• (Q3783598) (← links)
• An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs (Q4339008) (← links)
• (Q4813178) (← links)
• A parallel algorithm for edge-coloring partial k-trees (Q5054775) (← links)
• Efficient algorithms for the edge-cover coloring problem (Q5063668) (← links)
• Very fast parallel algorithms for approximate edge coloring (Q5929308) (← links)
• Edge coloring graphs with large minimum degree (Q6094039) (← links)
• Near-optimal distributed edge coloring (Q6102321) (← links)