An efficient algorithm for determining whether a cubic graph is toroidal

  • Authors:
  • I. S. Filotti

  • Affiliations:
  • -

  • Venue:
  • STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
  • Year:
  • 1978

Quantified Score

Hi-index 0.00

Visualization

Abstract

The algorithm of the title is presented. It runs in time bounded by a polynomial in the number of the edges of the graph.