Pages that link to "Item:Q4699171"
From MaRDI portal
The following pages link to The Compactness of Interval Routing (Q4699171):
Displaying 5 items.
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- Average stretch analysis of compact routing schemes (Q875595) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)
