IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2023-03-02 14:45
Correcting the algorithm for a minimum secure dominating set of proper interval graphs
Toru Araki, Ryuya Saito (Gunma Univ.) COMP2022-36
Abstract (in Japanese) (See Japanese page) 
(in English) In [A simple algorithm for secure domination in proper interval graphs, Discrete Applied Mathematics 260 (2019) 289--293 ], Zou, Liu, Hsu, and Wang proposed an algorithm for calculating a minimum secure dominating set of a proper interval graph. However, we find a counterexample for which the algorithm outputs an incorrect subset of vertices. This paper provides a modified algorithm and proof of correctness.
Keyword (in Japanese) (See Japanese page) 
(in English) secure dominating set / dominating set / proper interval graph / polynomial-time algorithm / / / /  
Reference Info. IEICE Tech. Rep., vol. 122, no. 414, COMP2022-36, pp. 16-20, March 2023.
Paper # COMP2022-36 
Date of Issue 2023-02-23 (COMP) 
ISSN Online edition: ISSN 2432-6380
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2022-36

Conference Information
Committee COMP  
Conference Date 2023-03-02 - 2023-03-02 
Place (in Japanese) (See Japanese page) 
Place (in English) Ochanomizu University 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Theoretical Computer Science, etc 
Paper Information
Registration To COMP 
Conference Code 2023-03-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Correcting the algorithm for a minimum secure dominating set of proper interval graphs 
Sub Title (in English)  
Keyword(1) secure dominating set  
Keyword(2) dominating set  
Keyword(3) proper interval graph  
Keyword(4) polynomial-time algorithm  
1st Author's Name Toru Araki  
1st Author's Affiliation Gunma University (Gunma Univ.)
2nd Author's Name Ryuya Saito  
2nd Author's Affiliation Gunma University (Gunma Univ.)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2023-03-02 14:45:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2022-36 
Volume (vol) vol.122 
Number (no) no.414 
Page pp.16-20 
Date of Issue 2023-02-23 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan