Pages that link to "Item:Q3332262"
From MaRDI portal
The following pages link to Distributed algorithms for finding centers and medians in networks (Q3332262):
Displaying 18 items.
- Distributed finite-time calculation of node eccentricities, graph radius and graph diameter (Q286507) (← links)
- Distributed processing of graphs: Fundamental cycles algorithm (Q1186357) (← links)
- An optimal parallel algorithm for computing furthest neighbors in a tree (Q1205722) (← links)
- A self-stabilizing distributed algorithm to find the median of a tree graph (Q1305938) (← links)
- An optimal distributed algorithm for recognizing mesh-connected networks (Q1314373) (← links)
- An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs (Q1577108) (← links)
- A linear-time algorithm for solving the center problem on weighted cactus graphs (Q1606995) (← links)
- Exact communication costs for consensus and leader in a tree (Q1827285) (← links)
- An efficient distributed bridge-finding algorithm (Q1894245) (← links)
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives (Q2428653) (← links)
- Statuses and double branch weights of quadrangular outerplanar graphs (Q2517156) (← links)
- The impact of the apex node on routing inside a pyramid structure (Q2572332) (← links)
- On the message complexity of distributed problems (Q3345763) (← links)
- Multiperiod medians on networks (Q3362084) (← links)
- FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL (Q4820169) (← links)
- Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees (Q5087837) (← links)
- An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)
- Distributed algorithm for finding a core of a tree network (Q6573933) (← links)
