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-12-20 10:20
On Enumerating All Maximal Cliques in Unit Disk Graphs
Daisuke Suzuki, Taisuke Izumi (Nagoya Inst. of Tech.) COMP2013-40
Abstract (in Japanese) (See Japanese page) 
(in English) This paper considers the problem of enumerating all maximal cliques in unit disk graphs, which is a plausible setting for applications of finding similar data groups. Our primary interest is to develop a faster algorithm using the geometric information about the metric space where the input unit disk graph is embedded. Assuming that the distance between any two vertices is available, we propose a new algorithm for that problem, which is based on two well-known algorithms, Bron-Kerbosch and one by Tomita et.al. The key idea of our algorithm is to find a good pivot quickly using geometric information. We validate the practical impact of our algorithm via experimental evaluations.
Keyword (in Japanese) (See Japanese page) 
(in English) enumerating maximal clique / Bron-Kerbosch algorithm / Unit disk graph / / / / /  
Reference Info. IEICE Tech. Rep., vol. 113, no. 371, COMP2013-40, pp. 15-20, Dec. 2013.
Paper # COMP2013-40 
Date of Issue 2013-12-13 (COMP) 
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 COMP2013-40

Conference Information
Committee COMP  
Conference Date 2013-12-20 - 2013-12-21 
Place (in Japanese) (See Japanese page) 
Place (in English) Okinawa Industry Support Center 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2013-12-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) On Enumerating All Maximal Cliques in Unit Disk Graphs 
Sub Title (in English)  
Keyword(1) enumerating maximal clique  
Keyword(2) Bron-Kerbosch algorithm  
Keyword(3) Unit disk graph  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Daisuke Suzuki  
1st Author's Affiliation Nagoya Institute of Technology (Nagoya Inst. of Tech.)
2nd Author's Name Taisuke Izumi  
2nd Author's Affiliation Nagoya Institute of Technology (Nagoya Inst. of Tech.)
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 2013-12-20 10:20:00 
Presentation Time 25 minutes 
Registration for COMP 
Paper # COMP2013-40 
Volume (vol) vol.113 
Number (no) no.371 
Page pp.15-20 
#Pages
Date of Issue 2013-12-13 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


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