Pages that link to "Item:Q1325996"
From MaRDI portal
The following pages link to A simple optimal parallel algorithm for a core of a tree (Q1325996):
Displaying 9 items.
- An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← links)
- Distributed algorithms for finding and maintaining a \(k\)-tree core in a dynamic network (Q1029012) (← links)
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (Q1198069) (← links)
- Parallel algorithm for finding a core of a tree network (Q1336753) (← links)
- A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates (Q1360244) (← links)
- Finding a 2-core of a tree in linear time (Q2784511) (← links)
- A Linear Time Algorithm for Finding ak-Tree Core (Q4339005) (← links)
- Distributed algorithm for finding a core of a tree network (Q6573933) (← links)