Login / Signup

Polynomial time algorithms on circular-arc overlap graphs.

Toshinobu KashiwabaraSumio MasudaKazuo NakajimaToshio Fujisawa
Published in: Networks (1991)
Keyphrases
  • computational complexity
  • learning algorithm
  • circular arcs
  • worst case
  • polynomial time complexity
  • graph isomorphism
  • gray scale