Pages that link to "Item:Q2192110"
From MaRDI portal
The following pages link to The \(b\)-branching problem in digraphs (Q2192110):
Displaying 16 items.
- Recursive properties of branching and BGG resolution (Q376931) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- Approximate maximum weight branchings (Q845674) (← links)
- Branching on a Sierpinski graph (Q1004392) (← links)
- Branchings in rooted graphs and the diameter of greedoids (Q1118604) (← links)
- An efficient algorithm for minimum-weight bibranching (Q1272485) (← links)
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- Shortest bibranchings and valuated matroid intersection (Q1926655) (← links)
- Relationship of two formulations for shortest bibranchings (Q2024606) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- An analogue of Edmonds' branching theorem for infinite digraphs (Q2225436) (← links)
- Edge-disjoint branchings in temporal digraphs (Q2236804) (← links)
- Balanced branchings in digraphs (Q2354769) (← links)
- (Q5005108) (← links)
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs (Q6045402) (← links)
- The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (Q6065852) (← links)