Pages that link to "Item:Q5368961"
From MaRDI portal
The following pages link to Optimal Distance Labeling Schemes for Trees (Q5368961):
Displaying 10 items.
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- Isometric Universal Graphs (Q4992841) (← links)
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)
- (Q5092373) (← links)
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs (Q5100967) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- (Q6065428) (← links)
- Better distance labeling for unweighted planar graphs (Q6103529) (← links)
