Pages that link to "Item:Q600259"

The following pages link to Linear algorithms for edge-coloring trees and unicyclic graphs (Q600259):

Displayed 7 items.

• Optimally edge-colouring outerplanar graphs is in NC (Q909461) ‎ (← links)
• A linear-time algorithm for finding a minimum spanning pseudoforest (Q1098629) ‎ (← links)
• The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984) ‎ (← links)
• A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles (Q1195493) ‎ (← links)
• A linear time algorithm for edge coloring of binomial trees (Q1916114) ‎ (← links)
• Efficient Vertex- and Edge-Coloring of Outerplanar Graphs (Q3705474) ‎ (← links)
• (Q5286018) ‎ (← links)