Pages that link to "Item:Q4699171"
From MaRDI portal
The following pages link to The Compactness of Interval Routing (Q4699171):
Displaying 19 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)
- Routing sets in the integer lattice (Q997064) (← links)
- Interval routing in reliability networks (Q1770375) (← links)
- The compactness of adaptive routing tables (Q1827290) (← links)
- The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices (Q2457012) (← links)
- On the hardness of minimizing space for all-shortest-path interval routing schemes (Q2465642) (← links)
- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
- Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818) (← links)
- On the computational complexity of continuous routing (Q4203819) (← links)
- Worst Case Bounds for Shortest Path Interval Routing (Q4209271) (← links)
- (Q4262693) (← links)
- (Q4945787) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)
- Close to linear space routing schemes (Q5964899) (← links)