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 2024-10-24 11:00
A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering
Kensuke Oowa, Peter Fulla, Takuro Fukunaga (Chuo Univ.) COMP2024-15
Abstract (in Japanese) (See Japanese page) 
(in English) The cluster editing problem is a problem of converting a given undirected graph into a set of cliques.
The chromatic correlation clustering (CCC) problem is a generalization of the cluster editing problem in which the edges are assigned colors and the aim is to create monochromatic cliques.
The problem is NP-hard, but a number of approximation algorithms for the problem are developed.
In contrast, no fixed-parameter tractable (FPT) algorithm for the CCC problem has yet been developed.
We present a novel framework that extends existing branching algorithms for cluster editing to solve chromatic correlation clustering.
We ensure that the extension causes no degradation in the overall time complexity.
To demonstrate its effectiveness, we apply the framework to an existing algorithm, thus creating an FPT algorithm for CCC with the same time complexity.
Keyword (in Japanese) (See Japanese page) 
(in English) cluster editing / correlation clustering / chromatic correlation clustering / fixed-parameter algorithms / parameterized algorithms / search tree algorithms / branching algorithms / FPT  
Reference Info. IEICE Tech. Rep., vol. 124, no. 223, COMP2024-15, pp. 15-20, Oct. 2024.
Paper # COMP2024-15 
Date of Issue 2024-10-17 (COMP) 
ISSN 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 COMP2024-15

Conference Information
Committee COMP  
Conference Date 2024-10-24 - 2024-10-24 
Place (in Japanese) (See Japanese page) 
Place (in English) Tohoku University Aobayama Campus 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Theoretical Computer Science, etc 
Paper Information
Registration To COMP 
Conference Code 2024-10-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering 
Sub Title (in English)  
Keyword(1) cluster editing  
Keyword(2) correlation clustering  
Keyword(3) chromatic correlation clustering  
Keyword(4) fixed-parameter algorithms  
Keyword(5) parameterized algorithms  
Keyword(6) search tree algorithms  
Keyword(7) branching algorithms  
Keyword(8) FPT  
1st Author's Name Kensuke Oowa  
1st Author's Affiliation Chuo University Graduate School (Chuo Univ.)
2nd Author's Name Peter Fulla  
2nd Author's Affiliation Chuo University (Chuo Univ.)
3rd Author's Name Takuro Fukunaga  
3rd Author's Affiliation Chuo University (Chuo 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 2024-10-24 11:00:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2024-15 
Volume (vol) vol.124 
Number (no) no.223 
Page pp.15-20 
#Pages 6 
Date of Issue 2024-10-17 (COMP) 

[Return to Top Page]

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