The following pages link to (Q5567717):
Displayed 17 items.
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs (Q930591) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- Rooted \(k\)-connections in digraphs (Q1025990) (← links)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- On the complexity of some arborescences finding problems on a multishop radio network (Q1123615) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Optimal labellings of rooted directed trees (Q1271877) (← links)
- An efficient algorithm for minimum-weight bibranching (Q1272485) (← links)
- Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
- A strongly polynomial algorithm for the inverse shortest arborescence problem (Q1383373) (← links)
- Arborescence optimization problems solvable by Edmonds' algorithm (Q1399999) (← links)
- Estimating an oncogenetic tree when false negatives and positives are present (Q1603295) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- A dual ascent approach for steiner tree problems on a directed graph (Q3315294) (← links)
- Approximating the Spanning k-Tree Forest Problem (Q5321721) (← links)