Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract    Edge monitoring  is a simple and effective mechanism for the security of wireless sensor networks. The idea is to award specific roles ( monitors ) to some sensor nodes of the network. A node  v  monitors an edge  e  if both extremities together with  v  form a triangle in the graph. Given an edge colored graph   G  =  (  V  ,  E  ,  c  )  , the color   c  (  e  )   is a positive integer representing the number of monitors needed by the edge  e . The problem is to seek a minimum cardinality subset of monitors  S  such that every edge  e  in the graph is monitored by at least   c  (  e  )   vertices in  S . If vertices of  G  are ighted, the objective then is to minimize the total ight of vertices of  S  and the problem is called  ighted edge monitoring problem . ,  present a polynomial-time algorithm for finding an edge monitoring set of minimum ight in interval graphs.
['Guillaume Bagan', 'Fairouz Beggas', 'Mohammed Haddad', 'Hamamache Hheddouci']
I am writing a research paper on a idea Edge Monitoring Problem on Interval Graphs
[{"from": "human", "value": "I am writing a research paper on a idea Edge Monitoring Problem on Interval Graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract    Edge monitoring  is a simple and effective mechanism for the security of wireless sensor networks. The idea is to award specific roles ( monitors ) to some sensor nodes of the network. A node  v  monitors an edge  e  if both extremities together with  v  form a triangle in the graph. Given an edge colored graph   G  =  (  V  ,  E  ,  c  )  , the color   c  (  e  )   is a positive integer representing the number of monitors needed by the edge  e . The problem is to seek a minimum cardinality subset of monitors  S  such that every edge  e  in the graph is monitored by at least   c  (  e  )   vertices in  S . If vertices of  G  are ighted, the objective then is to minimize the total ight of vertices of  S  and the problem is called  ighted edge monitoring problem . ,  present a polynomial-time algorithm for finding an edge monitoring set of minimum ight in interval graphs."}]