Abstract

Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title
Journal
Date
Author
Finding outer-connected dominating sets in interval graphs
Chiou-Jiun Lin ... Yue-Li Wang
Information Processing Letters | VOL. 115
Chiou-Jiun Lin, et. al.Chiou-Jiun Lin ... Yue-Li Wang
28 Jul 2015
On the problem of finding all maximum weight independent sets in interval and circular-arc graphs
S.K Dhall ... S Lakshmivarahan
-
S.K Dhall, et. al.S.K Dhall ... S Lakshmivarahan
03 Apr 1991
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs
Lhouari Nourine ... Mamadou Moustapha Kanté
SIAM Journal on Discrete Mathematics | VOL. 30
Lhouari Nourine, et. al.Lhouari Nourine ... Mamadou Moustapha Kanté
01 Jan 2015
On the Classes of Interval Graphs of Limited Nesting and Count of Lengths
...
-
, et. al. ...
01 Jan 2015
View more papers

More From: Discrete Applied Mathematics

Paper Title
Journal
Date
Author
Editorial Board
-
Discrete Applied Mathematics | VOL. 350
--
01 Jun 2024
Characterization of the Jaccard dissimilarity metric and a generalization
Georgios Gerasimou
Discrete Applied Mathematics | VOL. 355
Georgios GerasimouGeorgios Gerasimou
09 May 2024
Gated independence in graphs
Yusuf Civan ... Mehmet Akif Yetim
Discrete Applied Mathematics | VOL. 353
Yusuf Civan, et. al.Yusuf Civan ... Mehmet Akif Yetim
04 May 2024
Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]
Markus Ausserhofer ... Géza Tóth
Discrete Applied Mathematics | VOL. -
Markus Ausserhofer, et. al.Markus Ausserhofer ... Géza Tóth
01 May 2024
View more papers