Pages that link to "Item:Q1869735"
From MaRDI portal
The following pages link to Efficient algorithms for the minimum diameter bridge problem (Q1869735):
Displaying 7 items.
- Computing the optimal bridge between two convex polygons (Q294636) (← links)
- Efficient systolic algorithm for finding bridges in a connected graph (Q1099959) (← links)
- A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition (Q1788588) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Effective method for constrained minimum - reverse bridge theorem (Q2389506) (← links)
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (Q3373057) (← links)
- Computing the optimal bridge between two polygons (Q5949572) (← links)