Pages that link to "Item:Q1205722"
From MaRDI portal
The following pages link to An optimal parallel algorithm for computing furthest neighbors in a tree (Q1205722):
Displaying 5 items.
- An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← links)
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (Q1198069) (← links)
- A simple optimal parallel algorithm for a core of a tree (Q1325996) (← links)
- A linear-time algorithm for solving the center problem on weighted cactus graphs (Q1606995) (← links)
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks (Q2827807) (← links)