IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 5 of 5  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2023-12-22
16:25		 Miyazaki Miyazaki Univ. Machinaka Campus On a Self-Stabilizing Algorithm for a 1-Minimal Minus Domination Based on Loop Composition
Tota Yamada, Yonghwan Kim, Yoshiaki Katayama (NIT) COMP2023-27		 In this study, we introduce a new problem called the textit{1-Minimal Minus Domination} problem and a self-stabilizing a... [more] COMP2023-27
pp.68-75
COMP, IPSJ-AL 2021-05-07
17:10		 Online Online A self-stabilizing 1-minimal independent dominating set algorithm based on loop composition
Yuto Taniuchi (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2021-4		 We consider the 1-minimal independent dominating set (1-MIDS) problem: given a connected graph $G=(V,E)$, our goal is to... [more] COMP2021-4
pp.23-30
COMP 2019-12-13
09:25		 Gunma Ikaho Seminar House, Gunma University A Self-Stabilizing 1-maximal Independent Set Algorithm
Hideyuki Tanaka, Yuichi Sudo (Osaka Univ.), Hirotsugu Kakugawa (Ryukoku Univ.), Toshimitsu Masuzawa (Osaka Univ.), Ajoy K. Datta (UNLV) COMP2019-30		 We consider the 1-maximal independent set (1-MIS) problem: given a connected graph $G=(V,E)$, our goal is to find an 1-m... [more] COMP2019-30
pp.9-16
COMP 2019-03-18
17:05		 Tokyo The University of Tokyo On an Algorithm for Constructing a Strongly-Connected (2,2)-Directed Acyclic Graph in Biconnected Undirected Graph
Hiroki Aono, Yonghwan Kim, Yoshiaki Katayama (NIT) COMP2018-53		 ($s,t$)-DAG is an directed acyclic graph(DAG) that can be constructed by directing all edges on given biconnected undire... [more] COMP2018-53
pp.63-70
COMP 2008-04-18
15:30		 Osaka Osaka Prefecture University The Lower Bound on the Stabilization Time of Dijkstra's Three State Mutual Exclusion Algorithm
Masahiro Kimoto, Tatsuhiro Tsuchiya, Tohru Kikuno (Osaka Univ.) COMP2008-7		 The three state mutual exclusion algorithm is the first self-stabilizing algorithm which was proposed by E. W. Dijkstra.... [more] COMP2008-7
pp.41-47
 Results 1 - 5 of 5  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : 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)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan