Pages that link to "Item:Q1199461"

The following pages link to Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461):

Displaying 11 items.

• The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908) (← links)
• Survivable minimum bottleneck networks (Q904084) (← links)
• Higher-order triangular-distance Delaunay graphs: graph-theoretical properties (Q904106) (← links)
• An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes (Q908293) (← links)
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
• A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
• Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541) (← links)
• A linear time algorithm for the bottleneck biconnected spanning subgraph problem (Q1847357) (← links)
• The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)
• PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
• Fixed parameter tractability of a biconnected bottleneck Steiner network problem (Q6066052) (← links)