Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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 2013-01-23 15:45
Proposal of Algorithm to Finding Determiner Set for Graphs
Kurumi Kouchi, Mitsuru Nakata, Qi-Wei Ge (Yamaguchi Univ) MSS2012-57
Abstract (in Japanese) (See Japanese page) 
(in English) Given with a graph $G$ and its isomorphic graph $G'$, there may have multiple one-to-one correspondences between the vertices of $G$ and $G'$. If a part of correspondences of vertices are assigned then the correspondences of the remaining vertices can be uniquely determined. Such a set of assigned vertices is called determiner set and a determiner set is called minimum determiner set if no any its proper subset is determiner set. Further, a minimum determiner set with the least number of elements is called kernel set. In this paper, first we give necessary definitions and properties of determiner set as well as minimum determiner set and kernel set. Next we propose graph operations and an algorithm to find a determiner set and further propose an algorithm to find a minimum determiner set. Finally, we apply these algorithms to rescue workers' positioning problem to show the usefulness of our algorithm.
Keyword (in Japanese) (See Japanese page) 
(in English) graph / isomorphic graph / kernel set / determiner set / minimum determiner set / / /  
Reference Info. IEICE Tech. Rep., vol. 112, no. 383, MSS2012-57, pp. 65-70, Jan. 2013.
Paper # MSS2012-57 
Date of Issue 2013-01-15 (MSS) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
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)
Download PDF MSS2012-57

Conference Information
Committee MSS  
Conference Date 2013-01-22 - 2013-01-23 
Place (in Japanese) (See Japanese page) 
Place (in English) Osaka Int. Convention Center 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To MSS 
Conference Code 2013-01-MSS 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Proposal of Algorithm to Finding Determiner Set for Graphs 
Sub Title (in English)  
Keyword(1) graph  
Keyword(2) isomorphic graph  
Keyword(3) kernel set  
Keyword(4) determiner set  
Keyword(5) minimum determiner set  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Kurumi Kouchi  
1st Author's Affiliation Yamaguchi University (Yamaguchi Univ)
2nd Author's Name Mitsuru Nakata  
2nd Author's Affiliation Yamaguchi University (Yamaguchi Univ)
3rd Author's Name Qi-Wei Ge  
3rd Author's Affiliation Yamaguchi University (Yamaguchi Univ)
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2013-01-23 15:45:00 
Presentation Time 25 minutes 
Registration for MSS 
Paper # MSS2012-57 
Volume (vol) vol.112 
Number (no) no.383 
Page pp.65-70 
#Pages 6 
Date of Issue 2013-01-15 (MSS) 

[Return to Top Page]

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