Eurinardo R. Costa

  • Citations Per Year
Learn More
In 2010, it was proved that the interval number and the convexity number on the monophonic convexity are NP-hard on general graphs (Dourado et al., 2010). In this paper, we extend this results on themonophonic convexity.We prove that deciding if the interval number is at most 2 and deciding if the percolation time is at most 1 are NP-complete problems even(More)
  • 1