Edge monitoring problem on interval graphs

DOI10.1016/J.ENDM.2016.09.057zbMath1356.05140OpenAlexW2536665375MaRDI QIDQ510622

Mohammed Haddad, Hamamache Kheddouci, Fairouz Beggas, Guillaume Bagan

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.057

zbMATH Keywords

complexitypolynomial-time algorithminterval graphsedge monitoring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (1)

Complexity of edge monitoring on some graph classes

Cites Work

• A self-stabilizing algorithm for edge monitoring in wireless sensor networks
• Treewidth. Computations and approximations
• Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs

This page was built for publication: Edge monitoring problem on interval graphs