Pages that link to "Item:Q990080"
From MaRDI portal
The following pages link to A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080):
Displaying 6 items.
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Arc-disjoint paths and trees in 2-regular digraphs (Q2444565) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Precedence-constrained arborescences (Q6109804) (← links)
- Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs (Q6201032) (← links)
