Pages that link to "Item:Q1838313"
From MaRDI portal
The following pages link to A faster algorithm for finding edge-disjoint branchings (Q1838313):
Displaying 3 items.
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080) (← 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)
