Pages that link to "Item:Q1214942"

The following pages link to A good algorithm for edge-disjoint branching (Q1214942):

Displaying 14 items.

• Approximate maximum weight branchings (Q845674) (← links)
• A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080) (← links)
• Rooted \(k\)-connections in digraphs (Q1025990) (← links)
• The multi-tree approach to reliability in distributed networks (Q1109560) (← links)
• A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
• Edge-disjoint spanning trees and depth-first search (Q1217713) (← links)
• Edge-disjoint branching in directed multigraphs (Q1255784) (← links)
• Some generalizations of Menger's theorem concerning arc-connected digraphs (Q1377773) (← links)
• Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609) (← links)
• A faster algorithm for finding edge-disjoint branchings (Q1838313) (← links)
• Edge-disjoint branchings in temporal digraphs (Q2236804) (← links)
• Edge-Disjoint Branchings in Temporal Graphs (Q5041184) (← links)
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q5101431) (← links)
• Independent spanning trees with small depths in iterated line digraphs (Q5936460) (← links)