Login / Signup

On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.

A. BenkouarYannis ManoussakisVangelis Th. PaschosRachid Saad
Published in: ISA (1991)
Keyphrases
  • decision problems
  • np complete
  • problems involving
  • solving problems
  • data sets
  • computational complexity
  • polynomial time complexity