Pages that link to "Item:Q1025990"
From MaRDI portal
The following pages link to Rooted \(k\)-connections in digraphs (Q1025990):
Displaying 20 items.
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- Survivable network activation problems (Q386909) (← links)
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- Degree constrained node-connectivity problems (Q486998) (← links)
- Covering directed graphs by in-trees (Q626455) (← links)
- Leader localization in multi-agent systems subject to failure: a graph-theoretic approach (Q642928) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Covering Intersecting Bi-set Families under Matroid Constraints (Q2820858) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- Covering Directed Graphs by In-Trees (Q3511356) (← links)
- (Q5005108) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
- Matroid Intersection under Restricted Oracles (Q6161263) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
