The following pages link to (Q3514991):
Displaying 27 items.
- The rainbow vertex-index of complementary graphs (Q307925) (← links)
- Constrained surface-level gateway placement for underwater acoustic wireless sensor networks (Q443720) (← links)
- On segmenting logistical zones for servicing continuously developed consumers (Q462009) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- The vertex-rainbow index of a graph (Q726646) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- On two generalized connectivities of graphs (Q1692646) (← links)
- Minimum diameter vertex-weighted Steiner tree (Q2039644) (← links)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
- On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs (Q2174883) (← links)
- A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- The minimum size of a graph with given tree connectivity (Q2227103) (← links)
- A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs (Q2409788) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees (Q2448203) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- A tutorial on the balanced minimum evolution problem (Q2670555) (← links)
- Reliability assessment of the divide-and-swap cube in terms of generalized connectivity (Q2680983) (← links)
- The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
- Approximating minimum Steiner point trees in Minkowski planes (Q3064040) (← links)
- The Steiner Problem for Count Matroids (Q5041203) (← links)
- New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
- Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks (Q5374226) (← links)
- Min‐sum controllable risk problems with concave risk functions of the same value range (Q6065855) (← links)
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem (Q6106606) (← links)
- The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)