Pages that link to "Item:Q1173797"
From MaRDI portal
The following pages link to An algorithm for finding the absolute center of a network (Q1173797):
Displaying 10 items.
- The continuous center set of a network (Q757234) (← links)
- The absolute centre of a graph (Q793644) (← links)
- Group centre and group median of a network (Q1123113) (← links)
- Some new algorithms for location problems on networks (Q1291656) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256) (← links)
- A polynomial time algorithm for finding the absolute center of a network (Q4000529) (← links)
- Biobjective center – balance graph location model<sup>*</sup> (Q4265519) (← links)
- The absolute center of a network (Q4458724) (← links)
- Discrete Center Problems (Q5506720) (← links)