Pages that link to "Item:Q2566038"
From MaRDI portal
The following pages link to Informative labeling schemes for graphs (Q2566038):
Displaying 19 items.
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- Online computation with advice (Q541670) (← links)
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- A dynamic distributed approach to representing proper interval graphs (Q1045060) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- Proof labeling schemes (Q2377139) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- (Q4343056) (← links)
- (Q5092373) (← links)
- Labeling Schemes with Queries (Q5425964) (← links)
- Distributed Data Structures: A Survey on Informative Labeling Schemes (Q5756710) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- (Q6065428) (← links)
- Better distance labeling for unweighted planar graphs (Q6103529) (← links)
