The following pages link to (Q5005108):
Displaying 12 items.
- Recursive properties of branching and BGG resolution (Q376931) (← links)
- A faster algorithm for packing branchings in digraphs (Q494431) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- Branching on a Sierpinski graph (Q1004392) (← links)
- Branchings in rooted graphs and the diameter of greedoids (Q1118604) (← links)
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Balanced branchings in digraphs (Q2354769) (← links)
- Positive cases to the branch point problem (Q4354192) (← links)
- Integral packing of branchings in capacitaded digraphs (Q5963635) (← links)
- The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (Q6065852) (← links)
- The $b$-branching problem in digraphs (Q6297427) (← links)