Patrick Gwydion Poullie

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the vertices and assigning at most two (strict) intervals in this order to the ends of every edge allows to depict a(More)
  • 1