Pages that link to "Item:Q2354400"
From MaRDI portal
The following pages link to Approximability of minimum certificate dispersal with tree structures (Q2354400):
Displaying 6 items.
- Approximability and inapproximability of the minimum certificate dispersal problem (Q982648) (← links)
- Trust-based hexagonal clustering for efficient certificate management scheme in mobile ad hoc networks (Q2360125) (← links)
- Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains (Q3522906) (← links)
- (Q3761707) (← links)
- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem (Q5323050) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)