On Routing in Circulant Graphs

@inproceedings{Cai1999OnRI,
  title={On Routing in Circulant Graphs},
  author={Jin-Yi Cai and George Havas and Bernard Mans and Ajay Nerurkar and Jean-Pierre Seifert and Igor E. Shparlinski},
  booktitle={COCOON},
  year={1999}
}
We investigate various problems related to circulant graphs { nding the shortest path between two vertices, nding the shortest loop, and computing the diameter. These problems are related to shortest vector problems in a special class of lattices. We give matching upper and lower bounds on the length of the shortest loop. We claim NPhardness results, and establish a worst-case/average-case connection for the shortest loop problem. A pseudo-polynomial time algorithm for these problems is also… CONTINUE READING

From This Paper

Topics from this paper.
24 Citations
31 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Another NP-complete partition problem and the complexity of comput- ing short vectors in lattices

  • P. van Emde Boas
  • 1981
Highly Influential
4 Excerpts

On the complexity of computing short linearly independent vectors and short bases in a lattice

  • J. Blömer
  • To appear in the proceedings of STOC
  • 1999

Similar Papers

Loading similar papers…