Pages that link to "Item:Q987553"
From MaRDI portal
The following pages link to Arc-disjoint in-trees in directed graphs (Q987553):
Displaying 25 items.
- The root location problem for arc-disjoint arborescences (Q442209) (← links)
- On packing arborescences in temporal networks (Q477677) (← links)
- A note on disjoint arborescences (Q532132) (← links)
- Covering directed graphs by in-trees (Q626455) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← 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)
- Independent branchings in acyclic digraphs (Q1297456) (← links)
- On packing spanning arborescences with matroid constraint (Q1689956) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- An LP-based heuristic algorithm for the node capacitated in-tree packing problem (Q1762017) (← links)
- Disjoint paths in arborescences (Q1773369) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Independent arborescences in directed graphs (Q1937557) (← links)
- Reachability in arborescence packings (Q2166224) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Packing of maximal independent mixed arborescences (Q2217484) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- On reachability mixed arborescence packing (Q2419578) (← links)
- Covering intersecting bi-set families under matroid constraints (Q2820858) (← links)
- On maximal independent arborescence packing (Q2832576) (← links)
- Edmonds' branching theorem in digraphs without forward-infinite paths (Q2833123) (← links)
- (Q5005108) (← links)
- (Q5206398) (← links)
- Packing of spanning mixed arborescences (Q6056788) (← links)
