Complexity of edge monitoring on some graph classes
In this paper, we study the complexity of the edge monitoring problem. A vertex v monitors an edge e if both endpoints together with v form a triangle in the graph. Given a graph G=(V,E) and a weight function on edges c where c(e) is the number of monitors that needs the edge e, the problem is to se...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier B.V.
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |